This is the question: Q: Given the following production rules, which is finite or otherwise the most constrained language in the Chomsky language hier ...
Can someone tell me some reasons why the conversion of an NFA to DFA is useful? Until now I have found the following reasons (I am not sure of them): ...
L = { w belongs {0,1}* | w contain '110' and doesn't contain '010'} I need to construct DFA that receives L. How can I draw a DFA that will do the b ...
does anyone know about regular expressions of the following languages: the set of all strings starting with 000 and not ending 11 the set of all ...
Can someone help me with this error, i have spend more than an hour and got nothing Lib: https://pypi.org/project/automata-lib/ Here is the TypeError ...
I need to write a code in Java that will find the longest word that DFA accepts. Firstly, if there is transition to one of previous states (or self-tr ...
I know how to apply Kleene star on language but I'm not sure how would I apply it to DFA or NFA. I'm pretty sure it would need to be epsilon NFA with ...
Here the pair q0q5 is final/final, but their transition through input 1 is to q2/undefined (dead). Would the undefined be considered be considered non ...
For example, is this language regular or context-free language? On the one hand n can't be smaller than m but on the other hand you can't count n and ...
I am provided with a NFA and I need to use a data structure (I can not use recursive descent parser) for storing it. Once the NFA is stored in a data ...
This the question : L = { vwv : w,v ∈ {a,b}* , |v| = 2 } I draw it until W cames up idk what to do ! this is my way : ...
I need to build a state machine and write a control program to recognise a set of strings of zeros and ones, in which there are three zeros between ea ...
I've attached what I have. My problem is that I don't know if its correct and if I've even used the fewest states possible to answer this question. Re ...
The start state(S0) of my NFA has 2 outgoing epsilon transitions to S1 and S2, and, S1 and S2 have further transitions, and are disjoint of each other ...
I have a code in java for DFA simulation and I receive this error for loop below saying "i cannot be resolved to a variable". I dunno what is wrong wi ...
I have measurements of several characters (e.g., tail length) from hundreds of lizards. I have classified these lizards into 5 species based on a vari ...
Here is a simple but very common grammar rule case in EBNF format, the Statements is a none terminal symbol and Statement is none terminal symbol: ...
I want to create a DFA for language {1,0} which accepts only words build from sequences of odd 1 and 0. I've found many examples for DFA with even/odd ...
I have troubles in solving/proving this problem. I can understand that in a non regular no Finite State Automaton/Machine can be written that validate ...