Equational Theories of Scattered and Countable Series-parallel Posets (abstract)

A Study of a Simple Class of Modifiers: Product Modifiers (abstract)

On the Balancedness of Tree-to-word Transducers (abstract)

Context-Freeness of Word-MIX Languages (abstract)

Computing the Shortest String and the Edit-Distance for Parsing Expression Languages (abstract)

On Tree Substitution Grammars (abstract)

The Characterization of Rational Numbers Belonging to a Minimal Path in the Stern-Brocot Tree According to a Second Order Balancedness (abstract)

Avoidability of Additive Cubes over Alphabets of Four Numbers (abstract)

Sublinear-Time Language Recognition and Decision by One-Dimensional Cellular Automata (abstract)

Equivalence of Linear Tree Transducers with Output in the Free Group (abstract)

An approach to the Herzog-Schonheim conjecture using automata (abstract)

Operations on Permutation Automata (abstract)

On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations (abstract)

Complexity of Searching for 2 by 2 Submatrices in Boolean Matrices (abstract)

Computing Edit Distance (abstract)

Caratheodory Extensions of Subclasses of Regular Languages (abstract)

Deciding FO2 Alternation for Automata over Finite and Infinite Words (abstract)

Symmetry groups of infinite words (abstract)

Pointlike sets and separation: a personal perspective (abstract)

Branching Frequency and Markov Entropy of Repetition-Free Languages (abstract)

Reversible Top-Down Syntax Analysis (abstract)

Space Complexity of Stack Automata Models (abstract)

Balanced-by-construction regular and omega-regular languages (abstract)

Properties of Graphs Specified by a Regular Language (abstract)

The hardest LL(k) language (abstract)

Weighted Prefix Normal Words: Mind the Gap (abstract)

A Linear-time Simulation of Deterministic d-Limited Automata (abstract)

Bounded Languages Described by GF(2)-grammars (abstract)

Variations on the Post Correspondence Problem for free groups (abstract)

Guarded Kleene Algebra with Tests (abstract)

Upper Bounds on Distinct Maximal (Sub-)Repetitions in Compressed Strings (abstract)

Extremal Binary PFAs in a Cerny Family (abstract)

Reconstructing Words from Right-Bounded-Block Words (abstract)

Two-Way Non-Uniform Finite Automata (abstract)

Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata (abstract)

Parsimonious Computational Completeness (abstract)

Compositions of Constant Weighted Extended Tree Transducers (abstract)

Reducing local alphabet size in recognizable picture languages (abstract)

Active Learning of Sequential Transducers with Side Information about the Domain (abstract)

Parikh Word Representable Graphs and Morphisms (abstract)

A strong non-overlapping Dyck code (abstract)

Definability Results for Top-Down Tree Transducers (abstract)

Integer Weighted Automata on Infinite Words (abstract)

Second-order finite automata: expressive power and simple proofs using automatic structures (abstract)

The Range of State Complexities of Languages Resulting from the Cascade Product---The General Case (Extended Abstract) (abstract)

Morphic sequences versus automatic sequences (abstract)

The State Complexity of Lexicographically Smallest Words and Computing Successors (abstract)

On the Fine Grained Complexity of Finite Automata Non-Emptiness of Intersection (abstract)

Scattered Factor-Universality of Words (abstract)

State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters (abstract)

Lyndon words formalized in Isabelle/HOL (abstract)