List Question
20 TechQA 2015-06-15T10:39:32.920000Grammar for a^n
127 views
Asked by Themis Beris
Can final and non-final states having identical configurations be merged together in a minimal DFA?
703 views
Asked by C_beginner
Finding DFA of r* when r and DFA of r were deifined
278 views
Asked by BeginTP
How to call a structured language that cannot loop or a functional language that cannot return
396 views
Asked by user597759
What regular language intersects with 1*0* gives 1n0n
583 views
Asked by Eagle
Context free grammar for this language
1.2k views
Asked by ContextFreeBallin
What type of languages are accepted by a PDA in which stack size is limited?
4.8k views
Asked by Prashant Bhardwaj
Finiteness of Regular Language
3.6k views
Asked by Madhudeep Petwal
Notation for concat in set theory
9.4k views
Asked by Pinsickle
Python implementation for the CYK Algorithm
4.4k views
Asked by John Baltimore
CFG for a = b and c = d (length)
894 views
Asked by leander
When to use Ø for states in DFA / NFA
833 views
Asked by Pratik Hadawale
Design a turing machine to accept {1^n : n is prime number}
3.5k views
Asked by dullyourmind
How L={ww^Rx| where w, x belongs to {a,b}^* } is a regular language?
683 views
Asked by Shivam Chauhan
I want regular expression (theory of automata)
169 views
Asked by talhaaslam
Linear temporal logic (LTL) nad automata modelling
226 views
Asked by TheAptKid
Construct Context free Grammar
1.6k views
Asked by Sameer Jain
Are there any problems that are easier to implement on a turing machine than a conventional computer?
98 views
Asked by J. Rehbein
construct a PDA for the following language
559 views
Asked by Ike