DFA and Regular Expression...

Meaning of combined states in DFA...

Construct DFA for L = {(na(w)-nb(w)) mod 3>0}...

Pair of Zeros separated by 1's NFA?...

DFA that contains 1101 as a substring...

Minimal DFA for whole-words in regex...

NullPointerException for my States in my DFA?...

{w is in {a,b}*|w contains b only in some odds position}...

Space meaning in DFA?...

Regular expression in Automata Theory?...

How to determine which language is simpler...

Show that the language is decidable...

Creating a DFA at run time. How many states?...

Converting regex to a NFA transistion table...

Creating a DFA from : x^a y^b x^a...

Cross product of incomplete DFA's...

Converting DFA to RE...

Deterministic Finite State Automaton (DFA) Exam Q...

Estimate the number of states in a DFA (intersection)...

DFA that accepts strings over {b} of length 2i+5k for any non-negative values of i and k...

Is it possible for a DFA to change its state to a new state without accepting any input symbol...

Find the DFA for the language L given...

DFA to mathematical notation...

Why is E(dfa) a decidable language?...

Need to construct DFA (deterministic finite automaton)...

DFA running time is not O(n) but O(nm)...

Implementing a code to simulate a finite automaton nondeterministic in c++...

DFA construction in Knuth-Morris-Pratt algorithm...

dk.brics.automaton gets into infinite looping when given regex "a.b"?...

Parallel regex matching with NFA vs DFA? Which one is faster?...