Automata and natural language theory are topics lying at the heart of computer science. Both are linked to computational complexity and together, these disciplines help define the parameters of what constitutes a computer, the structure of programs, which problems are solvable by computers, and a range of other crucial aspects of the practice of computer science. In this important volume, two respected authors/editors in the field offer accessible, practice-oriented coverage of these issues with an emphasis on refining core problem solving skills.Example 3.23 Consider the following grammar G, in which a word of the form denotes a nonterminal, and other words denote terminals: ... if (cond) then ( matchstmt) else (stmt) I (simplestmt) (cond) a) G1 I G2 I C3 (simplestmt) a-agt; A1 I A; I A3.
|Title||:||Problem Solving in Automata, Languages, and Complexity|
|Author||:||Ding-Zhu Du, Ker-I Ko|
|Publisher||:||John Wiley & Sons - 2004-04-05|