List Question
20 TechQA 2024-01-08T11:38:56.133000how to model and verify model
23 views
Asked by saghar13
Context Free Grammar for L= { a^n b^m c^m d^2n }, where n and m are >= 0
131 views
Asked by Elijah
NFA or e-NFA for the condition , n % 5 = 0 where n is the number of 1s
31 views
Asked by Pepe Coco
Is there a parsing algorithm for languages generated by context-sensitive grammars?
97 views
Asked by Vivek Joshy
If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is?
24 views
Asked by Paras Bansal
Automata theory: Formal definition of indistinguishable & distinguishable strings and example confusion
1k views
Asked by mindoverflow
Can epsilon production be assumed in a left recursive grammar
69 views
Asked by Vedant Jumle
Prove that the following problem is undecidable by a reduction from the halting problem:
109 views
Asked by Suleyman Kiani
what is the Context-Free Grammar for the following language?
146 views
Asked by zephyrus
DFA- Set of all strings whose 10th symbol from the right end is 1
448 views
Asked by mark
Can we transfer every DFA to DFAs with start state having no in edge?
72 views
Asked by Pouya Kafashi
NFA or DFA accepting # of positions of 4k between 0's
209 views
Asked by mark
Regular expression for odd length of a's and odd length of b's
358 views
Asked by Jaffar
Using bracket for automata
91 views
Asked by Duy Duy
unable to display tables and diagrams in python for non deterministic finite automata
25 views
Asked by Yonathan
Regular expression for strings containing a's in multiples of 3
1.6k views
Asked by Thej Kiran
Representing regular expressions with DFA state diagrams
69 views
Asked by Marnie
the stack size in a PDA M can grow to hold at most k symbols. What kind of language is L(M)?
221 views
Asked by beezzyy
Regular Expression | Automata Theory
345 views
Asked by Apriana
C++ code example that makes the compile loop forever
200 views
Asked by Otávio Augusto Silva