Scribd
Upload
57 views

Toc CQ

The document contains 60 questions related to topics in formal languages and automata theory including definitions of one-to-one functions, properties of relations, mathematical induction, regular expressions, finite automata, context-free grammars, Turing machines, and more.

Uploaded by

DHRUV SHAH
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
57 views

Toc CQ

The document contains 60 questions related to topics in formal languages and automata theory including definitions of one-to-one functions, properties of relations, mathematical induction, regular expressions, finite automata, context-free grammars, Turing machines, and more.

Uploaded by

DHRUV SHAH
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

TOC-CQ

Q1) Define one-to-one, one-one, on-to, and inverse and bijection function. (3M)

Q2) The given relation R on set A= {1,2,3} determine whether the 04 Relation is reflexive, symmetric or transitive, give
reason. R ={(1,1), (1,2), (1, 3),(2,1), (2, 2), (3, 1),(3,3)}. (4M)

***Q3) Write and explain the principle of mathematical induction using example. (4M)

 Prove that for every n ≥ 1, 1 + 3 + 5 + … + (2n - 1) = n2. (7M)

 (7M)

Q4) Define FA and Write recursive definition of NFA . (3M)

***Q5) Find a regular expression of following subsets of {0, 1}* (4M)

1. The language of all strings that begin or end with 00 or 11.

2. The language of all strings ending with 1 and not containing 00.

***Q6) Draw Finite Automata to accept following over input alphabets Σ ={0, 1} (7M)

(i) The language accepting strings not ending with ’01’

(ii)The language accepting strings not containing substring ‘00’

Q7) (7M)

Q8) What are similarities and differences between Moore machines and Mealy machines? (4M)

***Q9) (4M)
***Q10) (7M)

Q11) Convert NFA- Λ to FA for following figure. (7M)

Q12)

NOW, (Q15)
Q17) Explain pumping lemma for regular languages. (3M)

Q18) Explain the Pumping Lemma for Context Free Languages. (4M)

Q19) Write Kleen’s Theorem part -1. (7M)

Q20)

***Q23)

Q29) Explain Universal Turing Machine. (3M)

Q30) Define: Set, Subset, Complement. (3M)

Q31) Explain Regular language & Regular expressions. (3M)

Q32) Define Context free grammar & context free language. (4M)

Q33) Define Regular grammar and give example (3M)

Q34) Give the difference between top down and bottom up parsing. (4M)
**C*Q35)

Q36) Explain Primitive Recursive Functions. (3M)

Q37) What is Turing machine? Explain its capabilities. (3M)

Q38) Enlist types of grammars, types of languages and types of automata. (3M)

Q39)

Q42) Explain conversion from PDA to CFG. (4M)

Q43) What is Instantaneous Description. (3M)

Q44) Enlist closure properties for the context sensitive language. (3M)

Q45) Discuss the closure properties of CFLs. (3M)

Q46) Compare NPDA with DPDA. (3M)

Q47) Explain conversion from PDA to CFG. (3M)

Q48) Design and draw PDA to accept string with more a’s than b’s. (7M)

Q49) Define the following operations for Push Down Automata: PUSH, POP, and SKIP. (3M)

Q50) Explain ambiguous and unambiguous context free grammar with example. (7M)
Q51)

Q57) Discuss “Distinguishability” of one string from another and explain how it affects the number of states in an FA.
Considering the example of 𝐿 = {𝑎, 𝑏} ∗ {𝑎𝑏𝑎}, how do the distinguishable strings in L relate to the number of states in its
FA? (7M)

Q58) When can we say that the language is decidable or undecidable? (3M)

Q59) Define: Bounded Minimalization and show that, if P is a primitive recursive (𝑛 + 1) place predicate, its bounded
minimalization 𝑚𝑃 is a primitive recursive function. (7M)

Q60) Define: 𝜇-Recursive functions and show how all computable functions are 𝜇 - recursive. (7M)

You might also like