Find a regular expression, Theory of Computation

Find a regular expression for the regular language L={w | w is decimal notation for an integer that is a multiple of 4}
Posted Date: 11/24/2012 3:22:47 PM | Location : United States







Related Discussions:- Find a regular expression, Assignment Help, Ask Question on Find a regular expression, Get Answer, Expert's Help, Find a regular expression Discussions

Write discussion on Find a regular expression
Your posts are moderated
Related Questions
Intuitively, closure of SL 2 under intersection is reasonably easy to see, particularly if one considers the Myhill graphs of the automata. Any path through both graphs will be a


The Recognition Problem for a class of languages is the question of whether a given string is a member of a given language. An instance consists of a string and a (?nite) speci?cat

The language accepted by a NFA A = (Q,Σ, δ, q 0 , F) is NFAs correspond to a kind of parallelism in the automata. We can think of the same basic model of automaton: an inpu

When an FSA is deterministic the set of triples encoding its edges represents a relation that is functional in its ?rst and third components: for every q and σ there is exactly one

design an automata for strings having exactly four 1''s


The key thing about the Suffx Substitution Closure property is that it does not make any explicit reference to the automaton that recognizes the language. While the argument tha


Construct a PDA that accepts { x#y | x, y in {a, b}* such that x ? y and xi = yi for some i, 1 = i = min(|x|, |y|) }. For your PDA to work correctly it will need to be non-determin