Register

minimum finite automata

1,072 views
0 0 votes
construct the minimul FA, that accepts all the string of 0's and 1's

A)The second symbol from the right end of the string is 0

B)The third symbol from the right end of the string is 1

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · kenneth rosenNext → · pipelining
← Previous in category · Minimum finite autom...Next in category → · self doubt
Position:
Show:

Related questions

0 0 votes
0 0 answers
831
831 views
arya_stark asked Oct 12, 2018
831 views
TOC : Minimum State in Finite Automata ( virtualgate )
For a binary string x = a0a1 · · · an−1 define val(x) to be the value of x interpreted as a binary number, where a0 is the most significant bit. More formally, val(x) is ...
0 0 votes
1 1 answer
4.3k
4.3k views
suraj patel asked Jul 10, 2018
4,332 views
Minimum finite automata
Construct the Minimum FA that accepts all the string of 0's and 1's whereA)Every String start and end with Zero.B)Every string Start and end with Same Symbol.
1 1 vote
1 answers 1 answer
1.1k
1.1k views
stillhere asked Sep 10, 2023
1,100 views
Minimal Finite Automata - Theory of Computation
Consider the set of all binary strings where the difference between the number of 0’s and number of 1’s is even. The minimum number of states in a DFA that accepts the gi...
0 0 votes
1 answers 1 answer
1.8k
1.8k views
Mizuki asked Nov 14, 2018
1,812 views
Finite Automata
When we convert a (minimal) NFA to DFA by subset construction method, is the DFA obtained always a minimal DFA?Please elaborate.