On the joint subword complexity of automatic sequences
Theoretical Computer Science
Limitations of lower bound methods for deterministic nested word automata
Information and Computation
On language decompositions and primality
Rainbow of computer science
Descriptional complexity of unambiguous nested word automata
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
State trade-offs in unranked tree automata
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
The copying power of well-nested multiple context-free grammars
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
State complexity of the concatenation of regular tree languages
Theoretical Computer Science
State complexity of kleene-star operations on trees
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Number of holes in unavoidable sets of partial words II
Journal of Discrete Algorithms
Transformations Between Different Models of Unranked Bottom-Up Tree Automata
Fundamenta Informaticae
Transition Complexity of Incomplete DFAs
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
State complexity and limited nondeterminism
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Lower bounds for the size of deterministic unranked tree automata
Theoretical Computer Science
Certain discrete dynamical systems, number systems and related integral self-affine sets
Theoretical Computer Science
Incomplete transition complexity of basic operations on finite languages
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions
Journal of Automated Reasoning
Hi-index | 0.00 |
Intended for graduate students and advanced undergraduates in computer science, A Second Course in Formal Languages and Automata Theory treats topics in the theory of computation not usually covered in a first course. After a review of basic concepts, the book covers combinatorics on words, regular languages, context-free languages, parsing and recognition, Turing machines, and other language classes. Many topics often absent from other textbooks, such as repetitions in words, state complexity, the interchange lemma, 2DPDAs, and the incompressibility method, are covered here. The author places particular emphasis on the resources needed to represent certain languages. The book also includes a diverse collection of more than 200 exercises, suggestions for term projects, and research problems that remain open.