Automata theory
The app is classroom notes & handbook on Automata theory subject for Information technology (IT), Computer Science engineering, discrete mathematics & Mathematics students. It is part of engineering education which brings important topics, notes, news & blog on the subject.
Automata play a major role in the theory of computation, compiler construction, artificial intelligence, parsing and formal verification. The purpose of the App is faster learning of the subject and quick revisions of the topics. The Topics are created in a manner to quickly absorb the subject.
It covers 138 topics of Automata in detail. These 138 topics are divided into 5 units.
Some of topics Covered in this application are:
1. Introduction to automata theory and Formal Languages2. Finite automata3. Deterministic finite state automaton (DFA)4. Sets5. Relations and Functions6. Asymptotic Behavior of Functions7. Grammar8. Graphs9. Languages10. Nondeterministic finite automaton11. Strings and Languages12. Boolean Logic13. Orders for Strings14. Operations on languages15. Kleene Star, ‘∗’16. Homomorphism17. Machines18. The power of DFAs19. Machine types that accept non-regular languages20. Equivalence of NFA and DFA21. Regular Expressions22. Regular Expressions and Languages23. Building Regular Expressions24. NFAs to Regular Expression25. Two-way Finite Automata26. Finite Automata with Output27. Properties of regular sets (Languages)28. Pumping Lemma29. Closure properties of regular languages30. Myhill-Nerode Theorem-131. Introduction to Context-Free Grammars32. Conversion of Left-linear Grammar into Right-Linear Grammar33. Derivation Tree34. Parsing35. Ambiguity36. Simplification of CFG37. Normal Forms38. Greibach Normal Form39. Pushdown Automata40. Transition Functions for NPDA41. Execution of NPDA42. Relation between pda and context free language43. CFG to NPDA44. NPDA to CFG45. Properties of context-free languages46. Proof of Pumping Lemma47. Usage of Pumping Lemma48. dicision Algorithms49. Turing Machine50. Programming a Turing Machine51. Turing Machines as Transducers52. Complete language and functions53. Modification of turing machines54. Church-turing thesis55. Enumerating Strings in a Language56. Halting Problem57. Rice's Theorem58. Context sensitive grammar and languages59. The chomsky hirarchy60. Unrestricted grammar61. Introduction to Complexity Theory62. polynomial time algorithm63. boolean satisfiablity64. Additional NP problem65. Formal systems66. Composition and recursion67. Ackermann's theorem68. Propositions69. Exampleof Non Deterministic Finite Automata70. Conversion of NFA to DFA71. Connectives72. Tautology, Contradiction and Contingency73. Logical Identities74. Logical inference75. Predicates and quantifiers76. Quantifiers and logical operators77. Normal forms78. Mealy and moore Machine79. Myhill-Nerode theorem80. Decision algorithms81. NFA with ε-moves82. Binary Relation Basics83. Transitive, and Related Notions84. Equivalence (Preorder plus Symmetry)85. The Power Relation between Machines86. Dealing with Recursion87. The Y operator88. The least fixed-point89. Error-correcting DFAs90. Ultimate Periodicity and DFAs91. The Automaton/Logic Connection92. Binary Decision Diagrams (BDDs)93. Basic Operations on BDDs94. Stabilization at a Fixed-Point95. A Taxonomy of Formal Languages and Machines96. Introduction to Push-down Automata97. Right
- and Left-Linear CFGs98. Developing CFGs99. A Pumping Lemma for CFLs100. A Pumping Lemma for CFLs101. Acceptance, Halting, Rejection102. NDTMs
Automata play a major role in the theory of computation, compiler construction, artificial intelligence, parsing and formal verification. The purpose of the App is faster learning of the subject and quick revisions of the topics. The Topics are created in a manner to quickly absorb the subject.
It covers 138 topics of Automata in detail. These 138 topics are divided into 5 units.
Some of topics Covered in this application are:
1. Introduction to automata theory and Formal Languages2. Finite automata3. Deterministic finite state automaton (DFA)4. Sets5. Relations and Functions6. Asymptotic Behavior of Functions7. Grammar8. Graphs9. Languages10. Nondeterministic finite automaton11. Strings and Languages12. Boolean Logic13. Orders for Strings14. Operations on languages15. Kleene Star, ‘∗’16. Homomorphism17. Machines18. The power of DFAs19. Machine types that accept non-regular languages20. Equivalence of NFA and DFA21. Regular Expressions22. Regular Expressions and Languages23. Building Regular Expressions24. NFAs to Regular Expression25. Two-way Finite Automata26. Finite Automata with Output27. Properties of regular sets (Languages)28. Pumping Lemma29. Closure properties of regular languages30. Myhill-Nerode Theorem-131. Introduction to Context-Free Grammars32. Conversion of Left-linear Grammar into Right-Linear Grammar33. Derivation Tree34. Parsing35. Ambiguity36. Simplification of CFG37. Normal Forms38. Greibach Normal Form39. Pushdown Automata40. Transition Functions for NPDA41. Execution of NPDA42. Relation between pda and context free language43. CFG to NPDA44. NPDA to CFG45. Properties of context-free languages46. Proof of Pumping Lemma47. Usage of Pumping Lemma48. dicision Algorithms49. Turing Machine50. Programming a Turing Machine51. Turing Machines as Transducers52. Complete language and functions53. Modification of turing machines54. Church-turing thesis55. Enumerating Strings in a Language56. Halting Problem57. Rice's Theorem58. Context sensitive grammar and languages59. The chomsky hirarchy60. Unrestricted grammar61. Introduction to Complexity Theory62. polynomial time algorithm63. boolean satisfiablity64. Additional NP problem65. Formal systems66. Composition and recursion67. Ackermann's theorem68. Propositions69. Exampleof Non Deterministic Finite Automata70. Conversion of NFA to DFA71. Connectives72. Tautology, Contradiction and Contingency73. Logical Identities74. Logical inference75. Predicates and quantifiers76. Quantifiers and logical operators77. Normal forms78. Mealy and moore Machine79. Myhill-Nerode theorem80. Decision algorithms81. NFA with ε-moves82. Binary Relation Basics83. Transitive, and Related Notions84. Equivalence (Preorder plus Symmetry)85. The Power Relation between Machines86. Dealing with Recursion87. The Y operator88. The least fixed-point89. Error-correcting DFAs90. Ultimate Periodicity and DFAs91. The Automaton/Logic Connection92. Binary Decision Diagrams (BDDs)93. Basic Operations on BDDs94. Stabilization at a Fixed-Point95. A Taxonomy of Formal Languages and Machines96. Introduction to Push-down Automata97. Right
- and Left-Linear CFGs98. Developing CFGs99. A Pumping Lemma for CFLs100. A Pumping Lemma for CFLs101. Acceptance, Halting, Rejection102. NDTMs
Category : Education
Related searches
Reviews (12)
Son. K.
Mar 29, 2018
Syntactic bugs have to be removed. Otherwise, is fantastic.
Bab. K.
Mar 25, 2018
It is very helpful like a tutor
A. G. u.
Mar 6, 2018
This app is very helpful
Roh. K.
Mar 1, 2017
Annoying update. When I click on link on page A, it takes me to another page B but when I press BACK button, content of A loads again. I mean make it to save master page for that link.
Rio. R.
Apr 26, 2017
It crashes few seconds after the splash screen.
shr. k.
Jun 3, 2017
Not working , install process complete and close app atomic not working app
Ham. K.
Mar 12, 2017
Problem in starting the App
Abh. K.
Oct 3, 2014
Nice app for basic of automata.But don't take it in examination hall.....;)
Kou. S.
Jun 11, 2014
Nice app for any time study
sag. g.
Apr 23, 2017
Faltu app that i seen ever why they wasting their time in that😝😝😝
Err. G.
Feb 6, 2017
Nyc and so easy to understand.
Useless app. Very short descriptions for all topics. Looks like the app was only made to make money. Also, The quiz doesn't even contain questions from Theory of Computation.