Volker Diekert, Dirk Nowotka
Proceedings of the 13th International Conference on Developments in Language Theory
DLT, 2009.

@proceedings{DLT-2009,
	address       = "Stuttgart, Germany",
	doi           = "10.1007/978-3-642-02737-6",
	editor        = "Volker Diekert and Dirk Nowotka",
	isbn          = "978-3-642-02736-9",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 13th International Conference on Developments in Language Theory}",
	volume        = 5583,
	year          = 2009,
}

Contents (40 items)

9 ×#word
6 ×#on the
5 ×#complexity
4 ×#bound
4 ×#logic
3 ×#automaton
3 ×#context-free grammar
3 ×#equation
3 ×#matrix
3 ×#regular expression

DLT-2009-Bojanczyk

Factorization Forests (MB), pp. 1–17.

DLT-2009-BolligG #logic #probability

Weighted versus Probabilistic Logics (BB, PG), pp. 18–38.

DLT-2009-Harju #matrix #problem

Post Correspondence Problem and Small Dimensional Matrices (TH), pp. 39–46.

DLT-2009-Kapoutsis #automaton #complexity #finite

Size Complexity of Two-Way Finite Automata (CAK), pp. 47–66.

DLT-2009-AlmeidaS #matrix

Matrix Mortality and the Cerný-Pin Conjecture (JA, BS), pp. 67–80.

DLT-2009-BealP #automaton #bound #clustering #polynomial #word

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, DP), pp. 81–90.

DLT-2009-BehleKR #quantifier #regular expression

Regular Languages Definable by Majority Quantifiers with Two Variables (CB, AK, SR), pp. 91–102.

DLT-2009-BertoniCR #context-free grammar #problem

The Inclusion Problem of Context-Free Languages: Some Tractable Cases (AB, CC, RR), pp. 103–112.

DLT-2009-BlakeleyBGR #complexity #on the #set #word

On the Complexity of Deciding Avoidability of Sets of Partial Words (BB, FBS, JG, NR), pp. 113–124.

DLT-2009-BrzozowskiGS #formal method #theorem

Closures in Formal Languages and Kuratowski’s Theorem (JAB, EG, JS), pp. 125–144.

DLT-2009-BucciLL #word

Rich and Periodic-Like Words (MB, AdL, ADL), pp. 145–155.

DLT-2009-CampanoniC #control flow #graph

Traces of Control-Flow Graphs (SC, SCR), pp. 156–169.

DLT-2009-Carton

Left and Right Synchronous Relations (OC), pp. 170–182.

DLT-2009-CzeizlerCKS #pseudo #word

An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words (EC, EC, LK, SS), pp. 183–194.

DLT-2009-DurandP #complexity

Asymptotic Cellular Complexity (BD, VP), pp. 195–206.

DLT-2009-Egecioglu #approximate #context-free grammar

Strongly Regular Grammars and Regular Approximation of Context-Free Languages (ÖE), pp. 207–220.

DLT-2009-Fazekas #regular expression

Powers of Regular Languages (SZF), pp. 221–227.

DLT-2009-FreydenbergerR

Existence and Nonexistence of Descriptive Patterns (DDF, DR), pp. 228–239.

DLT-2009-FriscoI #automaton #finite #multi #on the

On Stateless Multihead Finite Automata and Multihead Pushdown Automata (PF, OHI), pp. 240–251.

DLT-2009-FrougnyL #on the

On Negative Bases (CF, ACL), pp. 252–263.

DLT-2009-GlenHK #word

Crucial Words for Abelian Powers (AG, BVH, SK), pp. 264–275.

DLT-2009-GruberH #bound #complexity #regular expression

Tight Bounds on the Descriptional Complexity of Regular Expressions (HG, MH), pp. 276–287.

DLT-2009-JeandelT #logic

Subshifts, Languages and Logic (EJ, GT), pp. 288–299.

DLT-2009-Jiraskova

Magic Numbers and Ternary Alphabet (GJ), pp. 300–311.

DLT-2009-Kanazawa #context-free grammar #multi

The Pumping Lemma for Well-Nested Multiple Context-Free Languages (MK), pp. 312–325.

DLT-2009-Kirsten #commutative

The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable (DK), pp. 326–333.

DLT-2009-KountouriotisNR #boolean grammar #game studies

A Game-Theoretic Characterization of Boolean Grammars (VK, CN, PR), pp. 334–347.

DLT-2009-LaineP #equation #word

Word Equations with One Unknown (ML, WP), pp. 348–359.

DLT-2009-LehtinenO #equation #on the #set

On Equations over Sets of Numbers and Their Limitations (TL, AO), pp. 360–371.

DLT-2009-ManeaMS

Some Remarks on Superposition Based on Watson-Crick-Like Complementarity (FM, VM, JMS), pp. 372–383.

DLT-2009-Meinecke #calculus #word #μ-calculus

A Weighted μ-Calculus on Words (IM), pp. 384–395.

DLT-2009-MogaveroM #logic #quantifier

Branching-Time Temporal Logics with Minimal Model Quantifiers (FM, AM), pp. 396–409.

DLT-2009-Petersen #bound #simulation

Simulations by Time-Bounded Counter Machines (HP), pp. 410–418.

DLT-2009-Quaas #logic

Weighted Timed MSO Logics (KQ), pp. 419–430.

DLT-2009-RestivoR #word

Balanced Words Having Simple Burrows-Wheeler Transform (AR, GR), pp. 431–442.

DLT-2009-Saarela #complexity #equation #on the #satisfiability #theorem

On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations (AS), pp. 443–453.

DLT-2009-KudinovS #order #word

Definability in the Infix Order on Words (OVK, VLS), pp. 454–465.

DLT-2009-Shur #bound

Two-Sided Bounds for the Growth Rates of Power-Free Languages (AMS), pp. 466–477.

DLT-2009-Souza #decidability #equivalence #on the #transducer

On the Decidability of the Equivalence for a Certain Class of Transducers (RdS), pp. 478–489.

DLT-2009-Zetzsche #matrix #petri net

Erasing in Petri Net Languages and Matrix Grammars (GZ), pp. 490–501.