Émilie Charlier, Julien Leroy 0002, Michel Rigo
Proceedings of the 21st International Conference on Developments in Language Theory
DLT, 2017.

@proceedings{DLT-2017,
	doi           = "10.1007/978-3-319-62809-7",
	editor        = "Émilie Charlier and Julien Leroy 0002 and Michel Rigo",
	isbn          = "['978-3-319-62808-0', '978-3-319-62809-7']",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 21st International Conference on Developments in Language Theory}",
	volume        = 10396,
	year          = 2017,
}

Contents (28 items)

DLT-2017-Bruyere #approach #game studies #synthesis

Computer Aided Synthesis: A Game-Theoretic Approach (VB), pp. 3–35.

DLT-2017-Kitaev #formal method #graph

A Comprehensive Introduction to the Theory of Word-Representable Graphs (SK), pp. 36–67.

DLT-2017-Rowland #word

Binomial Coefficients, Valuations, and Words (ER), pp. 68–74.

DLT-2017-Skrzypczak #complexity #decidability #logic

Connecting Decidability and Complexity for MSO Logic (MS), pp. 75–79.

DLT-2017-Beier0 #complexity #on the #proving #regular expression

On Regular Expression Proof Complexity (SB, MH0), pp. 83–95.

DLT-2017-Beier0K #automaton #complexity #decidability #finite

Operational State Complexity and Decidability of Jumping Finite Automata (SB, MH0, MK), pp. 96–108.

DLT-2017-HugotBN #equivalence #transducer

Equivalence of Symbolic Tree Transducers (VH, AB, JN), pp. 109–121.

DLT-2017-BondtDZ #word

DFAs and PFAs with Long Shortest Synchronizing Word Length (MdB, HD, HZ), pp. 122–133.

DLT-2017-Broda0MMR #automaton #on the

On the Mother of All Automata: The Position Automaton (SB, MH0, EM, NM, RR), pp. 134–146.

DLT-2017-CartonES #automaton

Two-Way Two-Tape Automata (OC, LE, OS), pp. 147–159.

DLT-2017-EndrullisSS #automaton #finite

Undecidability and Finite Automata (JE, JOS, TS), pp. 160–172.

DLT-2017-GazdagT #on the #power of

On the Power of Permitting Semi-conditional Grammars (ZG, KT), pp. 173–184.

DLT-2017-GonzeGGJV #on the

On the Interplay Between Babai and Černý's Conjectures (FG, VVG, BG, RMJ, MVV), pp. 185–197.

DLT-2017-Grandjean #2d #difference #realtime

Differences Between 2D Neighborhoods According to Real Time Computation (AG), pp. 198–209.

DLT-2017-Herrmann

A Medvedev Characterization of Recognizable Tree Series (LH), pp. 210–221.

DLT-2017-HospodarJM #complexity #on the

On the Descriptive Complexity of Σ∗L (MH, GJ, PM), pp. 222–234.

DLT-2017-IbarraM #automaton #decidability #stack

Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties (OHI, IM), pp. 235–246.

DLT-2017-KuncM #rank

The Generalized Rank of Trace Languages (MK, JM), pp. 247–259.

DLT-2017-LodayaS #complexity #first-order #logic #quantifier

Two-Variable First Order Logic with Counting Quantifiers: Complexity Results (KL, AVS), pp. 260–271.

DLT-2017-MrazO #automaton

Deleting Deterministic Restarting Automata with Two Windows (FM, FO), pp. 272–283.

DLT-2017-0001RS #distance

Relative Prefix Distance Between Languages (TN0, DR, KS), pp. 284–295.

DLT-2017-PetrovaS #on the #word

On the Tree of Binary Cube-Free Words (EAP, AMS), pp. 296–307.

DLT-2017-PighizziniP #automaton

Limited Automata and Unary Languages (GP, LP), pp. 308–319.

DLT-2017-Richomme #infinity #word

A Characterization of Infinite LSP Words (GR), pp. 320–331.

DLT-2017-RubtsovV #automaton #complexity #on the #set

On Computational Complexity of Set Automata (AAR, MNV), pp. 332–344.

DLT-2017-Rukavicka #on the #word

On the Number of Rich Words (JR), pp. 345–352.

DLT-2017-Yamakami #automaton #bound #complexity #probability

One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity - (Preliminary Report) (TY), pp. 353–364.

DLT-2017-ZantemaB #permutation #sequence #transducer

Classifying Non-periodic Sequences by Permutation Transducers (HZ, WB), pp. 365–377.