## Is a*b* regular?

Answer to your question: imagine a*b* to be regular, Is there a proof for it being regular or not? No need to imagine, expression a*b* is called regular expression (re), and regular expressions are possible only for regular languages. If a language is not regular then regular expression is also not possible for that and … Read more

## How does “δ:Q×Σ→Q” read in the definition of a DFA (deterministic finite automaton)?

δ is like a mathematical function called the transition function . Something like. z = f(x, y) A function in mathematical defines mapping of elements in one set to another set. In function set of input arguments are called Domain of a function and output is the rage. [ANSWER]    In expression “δ:Q×Σ → Q”, … Read more

## drawing minmal DFA for the given regular expression

Regular Expression to DFA Although there is NO algorithmic shortcut to draw DFA from a Regular Expression(RE) but a shortcut technique is possible by analysis not by derivation, it can save your time to draw a minimized dfa. But off-course the technique you can learn only by practice. I take your example to show my … Read more

## Need Regular Expression for Finite Automata: Even number of 1s and Even number of 0s

How to write regular expression for a DFA using Arden theorem Lets instead of language symbols 0,1 we take Σ = {a, b} and following is new DFA. Notice start state is Q0 You have not given but In my answer initial state is Q0, Where final state is also Q0. Language accepted by is … Read more