Theoretical Computer Science - Implementation and application of automata
Arithmetic Meyer sets and finite automata
Information and Computation
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Enumeration and random generation of accessible automata
Theoretical Computer Science
A Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the Decidability of Bounded Valuedness for Transducers
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the Decidability of the Equivalence for k-Valued Transducers
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
A combinatorial study of k-valued rational relations
Journal of Automata, Languages and Combinatorics
Arithmetic Meyer sets and finite automata
Information and Computation
What do we know about language equations?
DLT'07 Proceedings of the 11th international conference on Developments in language theory
On transition minimality of bideterministic automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Numeration systems: a link between number theory and formal language theory
DLT'10 Proceedings of the 14th international conference on Developments in language theory
On the average number of states of partial derivative automata
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Infinite games and uniformization
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Uniformizing rational relations for natural language applications using weighted determinization
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Joint spectral radius theory for automated complexity analysis of rewrite systems
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Theme and variations on the concatenation product
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
The average transition complexity of Glushkov and partial derivative automata
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Enumeration and decidable properties of automatic sequences
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Some variants of the star height problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Set systems: Order types, continuous nondeterministic deformations, and quasi-orders
Theoretical Computer Science
Redundancy of minimal weight expansions in Pisot bases
Theoretical Computer Science
Computing maximal Kleene closures that are embeddable in a given constrained DNA language
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Bisimulations for fuzzy automata
Fuzzy Sets and Systems
On the supports of recognizable series over a field and a single letter alphabet
Information Processing Letters
Radix cross-sections for length morphisms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Sofic and almost of finite type tree-shifts
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Right-Sequential functions on infinite words
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Relating automata to other fields
Journal of Computing Sciences in Colleges
Rational transformations and a kleene theorem for power series over rational monoids
Algebraic Foundations in Computer Science
The language, the expression, and the (small) automaton
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
A note on sequential rule-based POS tagging
FSMNLP '11 Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Brzozowski's algorithm (co)algebraically
Logic and Program Semantics
Regular Transformations of Infinite Strings
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Iterating invertible binary transducers
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Decidability of geometricity of regular languages
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Visibly pushdown automata with multiplicities: finiteness and k-boundedness
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Unambiguous constrained automata
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Rational relations having a rational trace on each finite intersection of rational relations
Theoretical Computer Science
Theoretical Computer Science
Adding pebbles to weighted automata
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
Factor and subsequence kernels and signatures of rational languages
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
The removal of weighted ε-transitions
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
The parametric ordinal-recursive complexity of post embedding problems
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Weighted pushdown systems with indexed weight domains
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Expressiveness and static analysis of extended conjunctive regular path queries
Journal of Computer and System Sciences
Algebra-coalgebra duality in brzozowski's minimization algorithm
ACM Transactions on Computational Logic (TOCL)
The T-calculus: towards a structured programing of (musical) time and space
Proceedings of the first ACM SIGPLAN workshop on Functional art, music, modeling & design
Computing maximal Kleene closures that are embeddable in a given subword-closed language
Natural Computing: an international journal
Rational subsets and submonoids of wreath products
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Revisiting the equivalence problem for finite multitape automata
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
A uniformization theorem for nested word to word transductions
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Invertible transducers, iteration and coordinates
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Theory of Computing Systems
Theory of Computing Systems
Nondeterministic automata: Equivalence, bisimulations, and uniform relations
Information Sciences: an International Journal
From Two-Way to One-Way Finite State Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Quantitative Monadic Second-Order Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions
Journal of Automated Reasoning
Hi-index | 0.00 |
Automata theory lies at the foundation of computer science, and is vital to a theoretical understanding of how computers work and what constitutes formal methods. This treatise gives a rigorous account of the topic and illuminates its real meaning by looking at the subject in a variety of ways. The first part of the book is organised around notions of rationality and recognisability. The second part deals with relations between words realised by finite automata, which not only exemplifies the automata theory but also illustrates the variety of its methods and its fields of application. Many exercises are included, ranging from those that test the reader, to those that are technical results, to those that extend ideas presented in the text. Solutions or answers to many of these are included in the book.