Register

TOC True or False Question

• edited by
1,043 views

1 Answer

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

Related questions

682
views
2 answers
0 votes
pC asked Nov 17, 2015
682 views
Choose the false statement and give proper explanation to each
Consider the language$L_1 = \{a^n b^{2n} \mid n\geq 1 \},$and the homomorphism $h(p)=a, h(q)=aa.$Let $L_2= h^{-1} (L_1)$ ... ) that are not regular$L_2$ is not a CFL but is a CSL (Context Senstive Language)None of the above
User Avatar
330
views
1 answers
1 votes
Sandeep Suri asked Oct 26, 2017
330 views
Is the language ( )* regular? True or false explain with reason
Is the language ( )* regular? True or false explain with reason?
User Avatar
2.2k
views
2 answers
1 votes
Shubhanshu asked Oct 2, 2017
2,209 views
State True or False: Classes of Grammar and respective automata
Consider the following statements:-I) Type-0 grammar generate exactly all language that can be accepted by a total Turing machine.II) Type-1 grammar generate ... but both represent same regular expression as a+what is wrong in this??
User Avatar
1.4k
views
0 answers
0 votes
iarnav asked Sep 22, 2017
1,379 views
#TOC True or False Question regarding PDA
State T/Fif a language is deterministic context free it can always be accepted by a PDA?
User Avatar
Link Copied!