Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 84338

Questions about finite automata, an elementary automaton model with finite memory. It is equivalent to regular languages and the basis for many more complex models.

1
vote
1answer
I am learning how to minimize a DFA. One helpful approach is the Myhill-Nerode Theorem, which explains: Draw a table for all pairs of states (P,Q) Mark all pairs where P is a final state and Q is no …
asked Mar 12 '18 by maddie
4
votes
1answer
My textbook has a problem to find the regular expression that describes the set of all strings of 0's and 1's whose number of 0's is divisible by 5 and whose number of 1's is even. I can write a regu …
asked Mar 5 '18 by maddie
0
votes
0answers
Prompt: if $N$ is NFA that has at most one choice of state for any state and input symbol, then the DFA constructed from $N$ by subset construction has exactly the state and transitions of $N$ plus tr …
asked Mar 14 '18 by maddie
1
vote
0answers
I am trying to prove by induction that if $$\hat\delta_d(q_0, w) = \hat\delta_n(q_0, w)$$ I know by practicing inductive proofs of the $\hat\delta$ for DFAs, that on the basis of the definition of …
asked Feb 23 '18 by maddie
4
votes
1answer
In my textbook, it presents the theorem, "A language L is accepted by some DFA if and only if l is accepted by some NFA". My textbook explains that the "if" portion of the proof is given by the subset …
asked Mar 12 '18 by maddie