Register

Automata Theory by HMU

503 views

1 Answer

0 0 votes
Yes It is decidable . The finiteness of Context free grammar is decidable

Refrence: chapter 8 Theorem 8.7 Peter Linz text book
Voting & Accepting an answer helps improve the community
← Previous · Subnet MaskNext → · programming and ds
← Previous in category · MadeEasy Subject Tes...Next in category → · dfa gatebook QS
Position:
Show:

Related questions

0 0 votes
0 0 answers
506
506 views
wa_tle asked Feb 27, 2022
506 views
INTRODUCTION TO Automata Theory, Languages, and Computation by JOHN E. HOPCROFT
Design e - NF A for accepting decimal numbers
0 0 votes
0 0 answers
1.4k
1.4k views
Phantom5 asked Sep 3, 2018
1,401 views
Intro to Automata theory by Ullman Exercise 2nd
Exercise 2.2.8: Let A be a DFA and a particular input symbol of A, such that for all states q of A we have delta(q,a) = q.A) Show that for all n >= 0, Delta cap(q, a^n) ...
1 1 vote
0 0 answers
1.2k
1.2k views
hashir inayat asked Jul 17, 2017
1,158 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 ...
1 1 vote
1 answers 1 answer
259
259 views
Shahd_Algahim asked Dec 6, 2025
259 views
An Introduction to Formal Languages and Automata”, by Peter Linz. 7th edition: ISBN: 9781284231601
For Σ = {a, b} construct dfa’s that accept the sets consisting of “all strings with an even number of a’s” (give transition diagram of the finite machine)