Can I use stack in Turing Machine?...

Convert regular expression to CFG...

Using regular expressions check if a particular segment exist in a given string...

How to work with weighted automata dataset for Keras Regression...

Plotting Automata Grid Iterations in R...

Design a PDA of all strings of 0's and 1's that are not of the form ww^R...

Is it possible for a computer to "learn" a regular expression by user-provided examples?...

Regular Expression to DFA...

DFA that will accepts the string having odd number of 1's and odd number of 0's...

Use the pumping lemma to show that the following languages are not regular languages L = {anbm | n =...

Deterministic finite automata - state diagram...

Simplify Regular Expression, Automata Theory...

What will be the e-closure(r) in following NFA...

NFA for this specific design...

How to find longest accepted word by automata?...

How to apply Kleene star on automata?...

Construct Deterministic Accepter for binary string containing at any position...

Cell automat in Java...

In Context Free Grammer, do we replace all variable during a substitution? or can we apply substitut...

When to use Ø for states in DFA / NFA...

When minimizing DFAs through table fill, should a pair of final states transition to a final/undeter...

How do I see that there is a conflict in the LR(0) items automata?...

What is the point of the 4 grammars specified in Chomsky hierarchy?...

Check whether it accepts a finite determinant automaton at least one word of length k, if so - print...

Automata and Regex Theory Tools...

Does aabbabb belong to the regular expression ((a*| b*)bb)*?...

Are there any steps or rules to draw a DFA?...

Can a DFA have epsilon/lambda transitions?...

How to convert nested function call tree to state machine?...

How to implement a basic iterative pushdown automaton parsing algorithm with literal states and tran...