Invited papers
The New Complexity Landscape around Circuit Minimization
Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases
Approaching Arithmetic Theories with Finite-State Automata
Recompression: technique for word equations and compressed data
How to prove that a language is regular or star-free
Deciding classes of regular languages: the covering approach
Algebraic Structures
Nonstandard Cayley Automatic Representations for Fundamental Groups of Torus Bundles Over the Circle
Deciding (R,+, < ,1) in (R,+, < ,Z)
Ordered Semiautomatic Rings with Applications to Geometry
Automata
Boolean monadic recursive schemes as a logical characterization of the subsequential functions
Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models
Windable Heads & Recognizing NL with Constant Randomness
Alternating Finite Automata with Limited Universal Branching
Pebble-Intervals Automata and FO2 with Two Orders
Limited Two-Way Deterministic Finite Automata with Advice
Complexity
On the size of depth-two threshold circuits for the inner product mod 2 function
Complexity Issues of String to Graph Approximate Matching
Complexity of Automatic Sequences
Grammars
Context-sensitive Fusion Grammars are Universal
Cyclic shift on multi-component grammars
Languages
The Automatic Baire Property and an Effective Property of omega-Rational Functions
The Power of Programs over Monoids in J
Geometrically Closed Positive Varieties of Star-Free Languages
Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
Trees and Graphs
On the Weisfeiler-Leman Dimension of Fractional Packing
Input Strictly Local Tree Transducers
Words and Codes
Lyndon words versus inverse Lyndon words: queries on su xes and bordered words
On collapsing pre x normal words
Simplified Parsing Expression Derivatives
Complet e Variable-Length Codes: An Excursion into Word Edit Operations.