Automata theory

Automata theory is the study of abstract machines and automata. It is a theory in theoretical computer science, & discrete mathematics. Automata comes from the Greek word αὐτόματα meaning "self-acting".

The app is classroom notes on the subject for Information technology (IT), Computer Science engineering, discrete mathematics & Mathematics students.

The purpose of the App is faster learning of the subject and quick revisions of the topics. The Topics are created in manner to quickly absorb the subject.

It covers 138 topics of Automata in detail. These 138 topics are divided in 5 units.

Some of topics Covered in this application are:

1. Introduction to automata theory and Formal Languages

2. Finite automata

3. Deterministic finite state automaton (DFA)

4. Sets

5. Relations and Functions

6. Asymptotic Behavior of Functions

7. Grammar

8. Graphs

9. Languages

10. Nondeterministic finite automaton

11. Strings and Languages

12. Boolean Logic

13. Orders for Strings

14. Operations on languages

15. Kleene Star, ‘∗’

16. Homomorphism

17. Machines

18. The power of DFAs

19. Machine types that accept non-regular languages

20. Equivalence of NFA and DFA

21. Regular Expressions

22. Regular Expressions and Languages

23. Building Regular Expressions

24. NFAs to Regular Expression

25. Two-way Finite Automata

26. Finite Automata with Output

27. Properties of regular sets (Languages)

28. Pumping Lemma

29. Closure properties of regular languages

30. Myhill-Nerode Theorem-1

31. Introduction to Context-Free Grammars

32. Conversion of Left-linear Grammar into Right-Linear Grammar

33. Derivation Tree

34. Parsing

35. Ambiguity

36. Simplification of CFG

37. Normal Forms

38. Greibach Normal Form

39. Pushdown Automata

40. Transition Functions for NPDA

41. Execution of NPDA

42. Relation between pda and context free language

43. CFG to NPDA

44. NPDA to CFG

45. Properties of context-free languages

46. Proof of Pumping Lemma

47. Usage of Pumping Lemma

48. dicision Algorithms

49. Turing Machine

50. Programming a Turing Machine

51. Turing Machines as Transducers

52. Complete language and functions

53. Modification of turing machines

54. Church-turing thesis

55. Enumerating Strings in a Language

56. Halting Problem

57. Rice's Theorem

58. Context sensitive grammar and languages

59. The chomsky hirarchy

60. Unrestricted grammar

61. Introduction to Complexity Theory

62. polynomial time algorithm

63. boolean satisfiablity

64. Additional NP problem

65. Formal systems

66. Composition and recursion

67. Ackermann's theorem

68. Propositions

69. Exampleof Non Deterministic Finite Automata

70. Conversion of NFA to DFA

71. Connectives

72. Tautology, Contradiction and Contingency

73. Logical Identities

74. Logical inference

75. Predicates and quantifiers

76. Quantifiers and logical operators

77. Normal forms

78. Mealy and moore Machine

79. Myhill-Nerode theorem

80. Decision algorithms

81. NFA with ε-moves

82. Binary Relation Basics

83. Transitive, and Related Notions

84. Equivalence (Preorder plus Symmetry)

85. The Power Relation between Machines

86. Dealing with Recursion

87. The Y operator

88. The least fixed-point

89. Error-correcting DFAs

90. Ultimate Periodicity and DFAs

91. The Automaton/Logic Connection

92. Binary Decision Diagrams (BDDs)

93. Basic Operations on BDDs

94. Stabilization at a Fixed-Point

95. A Taxonomy of Formal Languages and Machines

96. Introduction to Push-down Automata

97. Right- and Left-Linear CFGs

98. Developing CFGs

99. A Pumping Lemma for CFLs

100. A Pumping Lemma for CFLs

101. Acceptance, Halting, Rejection

102. NDTMs

IMPORTANT LINKS

Feedback: Share your feedback at essyengineering@gmail.com

Social links

Facebook : https://www.facebook.com/EngineeringEasy/

Twitter : https://twitter.com/easyengineerin

Website:http://www.engineeringapps.net/

</div> <div jsname="WJz9Hc" style="display:none">自动机理论是抽象的机器和自动机的研究。正是在理论计算机科学理论，和离散数学。 αὐτόματα意思是“自我表演”自动机来自希腊字。

该应用程序是对信息技术（IT），计算机科学工程，离散数学与数学的学生主体课堂笔记。

该应用的目的是议题的主题和快速修订更快的学习。今天的题目是在创建方式，能够迅速吸收的主题。

几乎涵盖了自动机的138主题。这些138主题在5个单位划分。

一些在此应用中涉及的主题有：

1.介绍自动机理论和形式语言

2.有限自动机

3.确定有限状态自动机（DFA）

4.集

5.关系和功能

6.功能的渐近行为

7.语法

8.图

9.语言

10.非确定有限状态自动机

11.字符串和语言

12.布尔逻辑

13.订单弦乐

14.操作上的语言

15.克莱尼明星，¢â,¬ËœÃ¢Ë†â€“¢？€央行”¢

16.同态

17.机

18的DFA的力量

19.接受非正规语言的机器类型

20. NFA和DFA的等价

21.正则表达式

22.正则表达式和语言

23楼正则表达式

24. NFAS正则表达式

25.双向有限自动机

26.有限自动机与输出

27.定期套房产（语言）

28.泵引理

正规语言的29封闭性

30.迈希尔 - 尼罗德定理-1

31.介绍上下文无关文法

32.转换左线性文法到右键线性文法

33.派生树

34.解析

35.歧义

36.简化的CFG

37.范式

38.格雷巴赫标准式

39.下推自动机

对于NPDA 40.转移函数

41.执行NPDA的

42. PDA和上下文无关语言的关系

43. CFG到NPDA

44. NPDA到CFG

45.上下文无关语言的性质

46.​​抽证明引理

泵引理的47用法

48. dicision算法

49.图灵机

50.编程图灵机

51.图灵机作为传感器

52.完整的语言和功能

53.修改图灵机

54.教会图灵论题

55.枚举字符串的语言

56.停机问题

57. Rice定理

58.上下文相关的语法和语言

59.乔姆斯基hirarchy

60.无限制文法

61.介绍复杂性理论

62.多项式时间算法

63.布尔satisfiablity

64.其他NP问题

65.正式系统

66.组成和递归

67.阿克曼定理

68.命题

69. Exampleof非确定性有限自动机

NFA的70.转换为DFA

71.连接词

72.同义反复，矛盾与应急

73.逻辑标识

74.逻辑推理

75.谓词和量词

76.量词和逻辑运算符

77.范式

78.米利和摩尔机

79.迈希尔 - 尼罗德定理

80.决策算法

81. NFA与ÃŽÂμ，移动

82.二元关系基础

83.传递，以及相关概念

84.等效（预购加对称）

85.机器之间的权力关系

86.用递归处理

87.在Y运算符

88.至少定点

89.纠错的DFA

90.终极周期性和的DFA

91.自动机/逻辑连接

92.二元决策图（BDD）

93.基本操作上BDDS

94.稳定在一个固定点

形式语言和机器95.分类

96.介绍下推自动机

97.左手和线性CFGS

98.发展CFGS

99.泵引理节能灯

100.抽水引理节能灯

101.验收，停止，抑制

102. NDTMs

重要链接

反馈：分享您的反馈意见在essyengineering@gmail.com

社会联系

Facebook的：https://www.facebook.com/EngineeringEasy/

微博：https://twitter.com/easyengineerin

网址：http：//www.engineeringapps.net/</div> <div class="show-more-end">