Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors

RGPV short note on automata

Photo of author

By Team EasyExamNotes

RGPV 2010
Q. Write short note on automaton?

Ans. An automaton is an abstract self-propelled computing device which follows a predetermined sequence of operations automatically.
There are four major families of automaton :
  1. Finite-state machine.
  2. Pushdown automata.
  3. Linear-bounded automata.
  4. Turing machine.
1. Finite-state machine: A system where particular inputs cause particular changes in state can be represented using finite state machines. In it a state machine will read a series of inputs. When it reads an input, it will switch to a different state. Each state specifies which state to switch to, for a given input.

2. Pushdown automata: Pushdown automata are nondeterministic finite state machines augmented with additional memory in the form of a stack.

3. Linear-bounded automata: A linear bounded automaton is a nondeterministic Turing machine that satisfies the following three conditions:

  1. Its input alphabet includes two special symbols, serving as left and right endmarkers. 
  2. Its transitions may not print other symbols over the endmarkers.
  3. Its transitions may neither move to the left of the left endmarker nor to the right of the right endmarker.

4. Turing Machine: A Turing Machine is an accepting device which accepts the languages (recursively enumerable set) generated by type 0 grammars.  
Download as PDF

Related posts:

  1. RGPV TOC What do you understand by DFA how to represent it
  2. RGPV TOC properties of transition functions
  3. RGPV TOC What is Trap state
  4. CFL are not closed under intersection
  5. NFA to DFA | RGPV TOC
  6. Moore to Mealy | RGPV TOC PYQ
  7. DFA accept even 0 and even 1 |RGPV TOC PYQ
  8. Short note on automata | RGPV TOC PYQ
  9. DFA ending with 00 start with 0 no epsilon | RGPV TOC PYQ
  10. DFA ending with 101 | RGPV TOC PYQ
  11. Construct DFA for a power n, n>=0 || RGPV TOC
  12. Construct FA divisible by 3 | RGPV TOC PYQ
  13. Construct DFA equivalent to NFA | RGPV TOC PYQ
  14. RGPV Define Mealy and Moore Machine
  15. RGPV TOC Short note on equivalent of DFA and NFA
  16. RGPV notes Write short note on NDFA
  17. CNF from S–>aAD;A->aB/bAB;B->b,D->d.
  18. NDFA accepting two consecutive a’s or two consecutive b’s.
  19. Regular expresion to CFG
  20. Regular expression to Regular grammar
  21. Grammar is ambiguous. S → aSbS|bSaS|∈
  22. leftmost and rightmost derivations
  23. Construct Moore machine for Mealy machine
  24. Definition of Deterministic Finite Automata
  25. Notations for DFA
  26. How do a DFA Process Strings?
  27. DFA solved examples
  28. Definition Non Deterministic Finite Automata
  29. Moore machine
  30. Mealy Machine
  31. Regular Expression Examples
  32. Regular expression
  33. Arden’s Law
  34. NFA with ∈-Moves
  35. NFA with ∈ to DFA Indirect Method
  36. Define Mealy and Moore Machine
  37. What is Trap state ?
  38. Equivalent of DFA and NFA
  39. Properties of transition functions
  40. Mealy to Moore Machine
  41. Moore to Mealy machine
  42. Diiference between Mealy and Moore machine
  43. Pushdown Automata
  44. Remove ∈ transitions from NFA
  45. TOC 1
  46. Diiference between Mealy and Moore machine
  47. What is Regular Expression
  48. What is Regular Set in TOC
  49. DFA which accept 00 and 11 at the end of a string
  50. DFA end with 1 contain 00 | RGPV TOC draw
  51. RGPV TOC design finite automata problems
  52. Minimization of DFA
  53. Construct NFA without ∈
  54. RGPV TOC PYQs
  55. Introduction to Automata Theory