No one has voted on any posts yet. Votes from other community members are used to determine a member's reputation amongst their peers.
Student
- Interests
- Maths, Computers, Martial Atrs
|
I need to find the equivalence classes of the next regular language over {a,b,c}: L={wcw^R | w belongs to {a,b}* } any help would be apreciated ! thank you ! |
|
|
Hi guys, I have a problem with the following syntax: [COLOR=DarkRed]T -> T , k , T T -> nil T -> number[/COLOR] This is a BNF rule for binary trees. Assuming that [B]nil[/B] and [B]number[/B] are tokens, I need to remove the ambiguity of this grammar without restricting the … 
|
|
|
Hey people, I need help with this one: build a finite NON deterministic automata that accept the next language: language of all the words on {0,1,2} from the form: w=w1w2w3 that keep: w1 belongs to 0* w2 belongs to 1* w3 belongs to 2* |w| is even thank you ! |
|
|
Hello people, I am new around here, I need help with a question about Automata and Formal Languages, I can't solve this one. Thank you very much!! [URL=http://www.geocities.com/avifarzn/]http://www.geocities.com/avifarzn/[/URL] |