Scribd
Upload
1 views

FLAT SAQS

The document provides definitions and explanations of various computational models and grammars, including Pushdown Automata (PDA), Context-Free Grammar in Greibach Normal Form (GNF), Regular Grammar, Context-Sensitive Grammar, Linear Bounded Automata (LBA), and Turing Machines. It also discusses different types of languages (Regular, Context-Free, Context-Sensitive, Recursively Enumerable), decidability, and the Church-Turing Thesis. Additionally, it outlines the types of PDAs, Regular Grammars, and Turing Machines, along with the concepts of recursive and recursively enumerable languages.

Uploaded by

artdemios73
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
1 views

FLAT SAQS

The document provides definitions and explanations of various computational models and grammars, including Pushdown Automata (PDA), Context-Free Grammar in Greibach Normal Form (GNF), Regular Grammar, Context-Sensitive Grammar, Linear Bounded Automata (LBA), and Turing Machines. It also discusses different types of languages (Regular, Context-Free, Context-Sensitive, Recursively Enumerable), decidability, and the Church-Turing Thesis. Additionally, it outlines the types of PDAs, Regular Grammars, and Turing Machines, along with the concepts of recursive and recursively enumerable languages.

Uploaded by

artdemios73
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1.

Define PDA:
A Pushdown Automaton (PDA) is a computational model that uses a stack to store additional
information, extending the power of finite automata to recognize context-free languages.

2. List the types of PDA:

o Deterministic PDA (DPDA)

o Non-deterministic PDA (NPDA)

3. Formal definition of GNF:


A Context-Free Grammar is in Greibach Normal Form (GNF) if every production rule is of the
form:
A→aαA \rightarrow a\alphaA→aα, where aaa is a terminal and α\alphaα is a (possibly
empty) sequence of non-terminals.

4. Convert CFG to GNF:


Given:
S→CAS \rightarrow CAS→CA
A→aA \rightarrow aA→a
C→aB∣bC \rightarrow aB \mid bC→aB∣b
Convert:
S→aBA∣bAS \rightarrow aBA \mid bAS→aBA∣bA
A→aA \rightarrow aA→a
C→aB∣bC \rightarrow aB \mid bC→aB∣b

5. Define Regular Grammar:


A grammar is regular if its production rules are of the form A→aBA \rightarrow aBA→aB or
A→aA \rightarrow aA→a, where aaa is a terminal and A,BA, BA,B are non-terminals.

6. List the types of Regular Grammar:

o Right Linear Grammar

o Left Linear Grammar

7. Define Left Linear Grammar:


A grammar where all production rules have the form A→BAA \rightarrow BAA→BA or
A→aA \rightarrow aA→a, where BBB is a non-terminal, and aaa is a terminal.

8. Define Right Linear Grammar:


A grammar where all production rules have the form A→aBA \rightarrow aBA→aB or A→aA \
rightarrow aA→a, where BBB is a non-terminal, and aaa is a terminal.

9. Define Context Sensitive Grammar:


A grammar is context-sensitive if its production rules are of the form αAβ→αγβ\alpha A \

are strings of terminals and non-terminals, AAA is a non-terminal, and ∣γ∣≥∣A∣|\gamma| \geq
beta \rightarrow \alpha \gamma \betaαAβ→αγβ, where α,β,γ\alpha, \beta, \gammaα,β,γ

|A|∣γ∣≥∣A∣.

10. Define Linear Bounded Automata (LBA):


An LBA is a Turing Machine that operates on a tape with limited space proportional to the
length of the input.
11. Finite Automata for Regular Grammar S→aS∣bA∣bS \rightarrow aS \mid bA \mid
bS→aS∣bA∣b, A→aA∣bS∣aA \rightarrow aA \mid bS \mid aA→aA∣bS∣a:
Construct an automaton with states for SSS and AAA, transitions for a,ba, ba,b, and final
states based on terminal productions.

12. Finite Automata for Regular Grammar S→aS∣bS∣aAS \rightarrow aS \mid bS \mid
aAS→aS∣bS∣aA, A→bBA \rightarrow bBA→bB, B→AcB \rightarrow AcB→Ac:
Construct states S,A,BS, A, BS,A,B with transitions for a,b,ca, b, ca,b,c and final states as per
the terminal rules.

13. Define Turing Machine:


A Turing Machine is a computational model consisting of an infinite tape, a head for reading
and writing, a finite set of states, and a transition function.

14. Define the different types of languages:

 Regular

 Context-Free

 Context-Sensitive

 Recursively Enumerable

15. Define Unrestricted Grammar:


A grammar with no restrictions on production rules; it can generate any recursively
enumerable language.

16. List the types of Turing Machines:

 Deterministic Turing Machine (DTM)

 Non-deterministic Turing Machine (NDTM)

 Multi-tape Turing Machine

 Universal Turing Machine

 Linear Bounded Automaton (LBA)

17. Define decidability problem or Decidable Language:


A language is decidable if there exists a Turing Machine that halts and correctly decides
whether any given input belongs to the language.

18. What is Partial Decidability Language?


A language is partially decidable if a Turing Machine accepts all strings in the language but
may loop indefinitely for strings not in the language.

19. What is Undecidable Language?


A language is undecidable if no Turing Machine can decide it for all inputs.

20. State Church’s Hypothesis or Church-Turing Thesis:


Any computation that can be performed by an effective method can be performed by a
Turing Machine.

21. Define Recursive and Recursively Enumerable Language:


 Recursive: A language is recursive if there exists a Turing Machine that halts on every input
and decides membership.

 Recursively Enumerable: A language is recursively enumerable if a Turing Machine can


enumerate all strings in the language.

22. List the types of Turing Machines:


Same as question 16.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy