Ambiguity and Communication

An automaton over data words that captures EMSO logic

An Efficient Finite Tree Automata Library

An Entertaining Example of Using the Concepts of Context-Free Grammar and Pushdown Automation

An Extension of Parikh's Theorem beyond Idempotence

An Individual-based Probabilistic Model for Fish Stock Simulation

An introduction to finite automata and their connection to logic

An undecidable property of context-free languages

An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid

Answers to Questions Formulated in the Paper "On States Observability in Deterministic Finite Automata"

Approximating Petri Net Reachability Along Context-free Traces

Approximating the minimum length of synchronizing words is hard

Arenas of Finite State Machines

Around Dot-depth One

Aspects of enumeration and generation with a string automata representation

Asymptotic enumeration of Minimal Automata

Asynchronous Games over Tree Architectures

Automata and Reduced Words in the Free Group

Automata finiteness criterion in terms of van der Put series of automata functions

Automatic Theorem-Proving in Combinatorics on Words