Questions about finite-automata
Read more about finite-automata
python (65.1k questions)
javascript (44.2k questions)
reactjs (22.7k questions)
java (20.8k questions)
c# (17.4k questions)
html (16.3k questions)
r (13.7k questions)
android (12.9k questions)
why a^m b^n where m,n > 0 is a regular language but a^n b^n where n > 0 is non regular language
a^m b^n where m,n >= 0 is a regular language but why a^n b^n where n >= 0 is a non-regular language?
In both languages, we are taking an infinite number of a's and b's but why we could build a F...
Priyansh Srivastava
Votes: 0
Answers: 3
Draw NFA for regular language
Here I found a example for a regular language.
L = { a^n | n>=2 } is regular. Clearly, we can draw a finite automaton with 3 states.
I was asking myself how this graph would look like. If I choos...
Johnny
Votes: 0
Answers: 2
L_mult={a^i b^ij c^j:i,j≥0}, what would be the graph of diagram machine
L_mult={a^i b^ij c^j:i,j≥0}, what would be the diagram of turing machine.
Here the number of b's will be equal to the number of a's times number of c's. How can draw the turning machine of this lanagu...
kowser66
Votes: 0
Answers: 0
How to deal with epsilon transitions while converting NFA to DFA?
The start state(S0) of my NFA has 2 outgoing epsilon transitions to S1 and S2, and, S1 and S2 have further transitions, and are disjoint of each other. So do I consider {S1,S2} as one state while conv...
shardul
Votes: 0
Answers: 1