Scribd
Upload
20 views3 pages

Tcs Short Ans

Uploaded by

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

Tcs Short Ans

Uploaded by

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

1.

DFA (Deterministic Finite Automaton)

Definition: A theoretical machine used to recognize regular languages. It has a finite set of states, and
for each state and input symbol, there is exactly one transition to another state.

2. NFA (Nondeterministic Finite Automaton)

Definition: Similar to DFA, but can have multiple transitions for the same input symbol from a given
state. NFAs can be converted to equivalent DFAs.

3. Moore Machine

Definition: A finite state machine where the outputs are determined solely by the current state, not
the input.

4. Mealy Machine

Definition: A finite state machine where the outputs depend on both the current state and the
current input.

5. PDA (Pushdown Automaton)

Definition: An automaton that uses a stack to provide additional memory, allowing it to recognize
context-free languages.

6. Turing Machine

Definition: A theoretical machine that manipulates symbols on a tape according to a set of rules. It is
capable of simulating any algorithm.

7. Regular Expression

Definition: A sequence of characters that define a search pattern, primarily used for string matching
within texts.

8. Regular Grammar

Definition: A type of grammar that produces regular languages. It can be right-linear or left-linear.

9. String

Definition: A finite sequence of characters from a given alphabet.


10. Alphabet

Definition: A finite set of symbols from which strings are formed.

11. Symbol

Definition: A single character from the alphabet used to form strings.

12. Prefix

Definition: A substring that contains the initial part of a string.

13. Suffix

Definition: A substring that contains the ending part of a string.

14. CFG (Context-Free Grammar)

Definition: A grammar that can generate all strings of a context-free language. Used in programming
language design.

15. Reduction

Definition: The process of transforming one problem into another problem, typically to show
complexity relationships.

16. Derivation

Definition: A sequence of production rules applied to generate a string from a grammar.

17. Parse Tree

Definition: A tree representation of the syntactic structure of a string according to a context-free


grammar.

18. Ambiguous Grammar

Definition: A context-free grammar that can generate the same string in multiple ways, resulting in
multiple parse trees.
19. DPDA (Deterministic Pushdown Automaton)

Definition: A PDA with at most one possible action for each input symbol and stack configuration.

20. NPDA (Nondeterministic Pushdown Automaton)

Definition: A PDA that can have multiple possible actions for a given input symbol and stack
configuration.

21. Multitape Turing Machine

Definition: A Turing machine that has multiple tapes, each with its own head for reading and writing.

22. Two-way Multitape Turing Machine

Definition: A multitape Turing machine where the tapes can move in both directions (left and right).

23. Non-deterministic Turing Machine

Definition: A Turing machine that can make arbitrary choices from several possibilities during
computation.

24. Nullable Symbol

Definition: A non-terminal in a context-free grammar that can derive the empty string.

25. Unit Production

Definition: A production rule in a context-free grammar where a non-terminal maps to a single non-
terminal.

26. Types of Chomsky Hierarchy

Type 0: Unrestricted Grammars (Turing machines)

Type 1: Context-Sensitive Grammars (Linear bounded automaton)

Type 2: Context-Free Grammars (Pushdown automaton)

Type 3: Regular Grammars (Finite automaton)

You might also like