81. What is a language in the context of formal language theory?
82. What is the alphabet of a formal language?
83. What is a string in the context of formal languages?
84. What does it mean for a string to be accepted by an automaton?
85. What are closure properties?
86. What is a complement of a language?
87. What is the intersection of two languages?
88. How does a DFA differ from an NFA in terms of expressiveness?
89. Can every NFA be converted to a DFA?
90. What is the power set construction (subset construction) method?
91. What is the Myhill-Nerode Theorem?
92. How is the Myhill-Nerode Theorem used to minimize DFA?
93. What is a language operation?
94. What is concatenation in the context of languages?
95. How does union work in the context of languages?
96. What is the intersection of regular languages?
97. What is the closure of regular languages under intersection?
98. How does complement work in regular languages?
99. What are non-regular languages?
100. What are context-sensitive languages?
101. How do context-sensitive languages differ from context-free languages?
102. What is a deterministic context-free language?
103. What is ambiguity in a context-free language?
104. Can deterministic pushdown automata recognize all context-free languages?
105. What is a two-way finite automaton?
106. How does a two-way finite automaton differ from a standard finite automaton?
107. What is the complexity of a Turing machine?
108. What is a decision problem?
109. What is a language problem?
110. What is a regular set?
111. What is the union of two regular sets?
112. How is the intersection of two regular sets defined?
113. What are the closure properties of finite languages?
114. How are infinite languages classified?
115. What is a terminal symbol in a formal grammar?
116. What is a non-terminal symbol in a formal grammar?
117. What is a production rule in a formal grammar?
118. How do you prove that a context-free language is ambiguous?
119. What is a derivation tree?
120. How does backtracking work in a PDA?