Developments in Language Theory

Descriptional Complexity of Nondeterministic Finite Automata

Pages 31-35

Salomaa, Kai

From Determinism to Non-determinism in Recognizable Two-Dimensional Languages

Pages 36-47

Anselmo, Marcella (et al.)

Coding Partitions: Regularity, Maximality and Global Ambiguity

Pages 48-59

Béal, Marie-Pierre (et al.)

Multi-letter Reversible and Quantum Finite Automata

Pages 60-71

Belovs, Aleksandrs (et al.)

Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids

Pages 72-83

Bertoni, Alberto (et al.)

The Dynamics of Cellular Automata in Shift-Invariant Topologies

Pages 84-95

Bienvenu, Laurent (et al.)

Two Element Unavoidable Sets of Partial Words

Pages 96-107

Blanchet-Sadri, F. (et al.)

Hairpin Finite Automata

Pages 108-119

Bordihn, Henning (et al.)

Characterizing Reduction Graphs for Gene Assembly in Ciliates

Pages 120-131

Brijder, Robert (et al.)

2-Visibly Pushdown Automata

Pages 132-144

Carotenuto, Dario (et al.)

An Efficient Computation of the Equation $\mathbb{K}$-Automaton of a Regular $\mathbb{K}$-Expression

Pages 145-156

Champarnaud, Jean-Marc (et al.)

An Extension of Newton’s Method to ω-Continuous Semirings

Pages 157-168

Esparza, Javier (et al.)

Non-constructive Methods for Finite Probabilistic Automata

Pages 169-180

Freivalds, Rūsiņš

The Unambiguity of Segmented Morphisms

Pages 181-192

Freydenberger, Dominik D. (et al.)

Commutation of Binary Factorial Languages

Pages 193-204

Frid, Anna E.

Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP

Pages 205-216

Gruber, Hermann (et al.)

State Complexity of Union and Intersection of Finite Languages

Pages 217-228

Han, Yo-Sub (et al.)

Bisimulation Minimisation for Weighted Tree Automata

Pages 229-241

Högberg, Johanna (et al.)

Conjunctive Grammars Can Generate Non-regular Unary Languages

Pages 242-253

Jeż, Artur

Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet

Pages 254-265

Jirásek, Jozef (et al.)

Reduced Languages as ω-Generators

Pages 266-277

Julia, Sandrine (et al.)

Avoiding Approximate Squares

Pages 278-289

Krieger, Dalia (et al.)

Duplication Roots

Pages 290-299

Leupold, Peter

Complexity Theory for Splicing Systems

Pages 300-311

Loos, Remco (et al.)

Descriptional Complexity of Bounded Context-Free Languages

Pages 312-323

Malcher, Andreas (et al.)

Definable Transductions and Weighted Logics for Texts

Pages 324-336

Mathissen, Christian

A Star Operation for Star-Free Trace Languages

Pages 337-345

Ochmański, Edward (et al.)

Finite Automata on Unranked and Unordered DAGs

Pages 346-360

Priese, Lutz

On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases

Pages 361-370

Pritykin, Yuri

A Local Balance Property of Episturmian Words

Pages 371-381

Richomme, Gwénaël

Suffix Automata and Standard Sturmian Words

Pages 382-398

Sciortino, Marinella (et al.)

Fine Hierarchy of Regular Aperiodic ω-Languages

Pages 399-410

Selivanov, Victor L.

On Transition Minimality of Bideterministic Automata

Pages 411-421

Tamm, Hellis