Register

INTRODUCTION TO Automata Theory, Languages, and Computation by JOHN E. HOPCROFT

293 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
1 answer
1
jaiganeshcse94 asked Jul 28, 2016
675 views
Introduction to languages and the theory of computing by "john c martin" page no. 48
A minimal DFA for language L={x∈{a, b}* | x ends with 'b' and does not contain the substring 'aa'}?
A minimal DFA for language L={x∈{a, b}* | x ends with 'b' and does not contain the substring 'aa'}?
User Avatar
0 votes
0 votes
0 answers
2
Silver_Reaper asked Jan 24, 2023
394 views
An Introduction to Formal Languages and Automata Peter Linz 6th Edition.Exercise 2.1 4 d,e
For Σ = {a, b}, construct dfa’s that accept the sets consisting of: (d) all strings with at least one b and exactly two a’s. (e) all the strings with exactly two a’s and more than three b’s.
For Σ = {a, b}, construct dfa’s that accept the sets consisting of:(d) all strings with at least one b and exactly two a’s.(e) all the strings with exactly two a’s...
User Avatar
0 votes
0 votes
1 answer
3
Silver_Reaper asked Jan 28, 2023
691 views
An Introduction to Formal Languages and Automata,6th edition,Exercise 2.3 Q2.
Convert the nfa in Exercise 13, Section 2.2, into an equivalent dfa.
Convert the nfa in Exercise 13, Section 2.2, into an equivalent dfa.
User Avatar
1 votes
1 votes
0 answers
4
hashir inayat asked Jul 17, 2017
966 views
introduction to computer theory by daniel cohen 2nd edition Chapter#05 Finite automata question 12
Suppose a particular FA, called FIN, has the property that it had only one final state that was not the start state. During the night, vandals come and switch the + sign ...
User Avatar
Link Copied!