Marie-Pierre Béal, Olivier Carton
Proceedings of the 17th International Conference on Developments in Language Theory
DLT, 2013.

@proceedings{DLT-2013,
	address       = "Marne-la-Vallée, France",
	doi           = "10.1007/978-3-642-38771-5",
	editor        = "Marie-Pierre Béal and Olivier Carton",
	isbn          = "978-3-642-38770-8",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 17th International Conference on Developments in Language Theory}",
	volume        = 7907,
	year          = 2013,
}

Contents (39 items)

11 ×#automaton
8 ×#word
6 ×#finite
3 ×#complexity
3 ×#on the
3 ×#problem
3 ×#regular expression
2 ×#ambiguity
2 ×#context-free grammar
2 ×#linear

DLT-2013-Freivalds #automaton #finite #turing machine

Ultrametric Finite Automata and Turing Machines (RF), pp. 1–11.

DLT-2013-Jez #equation #named #word

Recompression: Word Equations and Beyond (AJ), pp. 12–26.

DLT-2013-Jungers

Joint Spectral Characteristics: A Tale of Three Disciplines (RMJ), pp. 27–28.

DLT-2013-Loding #ambiguity #automaton #finite

Unambiguous Finite Automata (CL), pp. 29–30.

DLT-2013-Pin #regular expression

An Explicit Formula for the Intersection of Two Polynomials of Regular Languages (JÉP), pp. 31–45.

DLT-2013-AnselmoGM #2d

Two Dimensional Prefix Codes of Pictures (MA, DG, MM), pp. 46–57.

DLT-2013-AtigKS #multi #order

Adjacent Ordered Multi-Pushdown Systems (MFA, KNK, PS), pp. 58–69.

DLT-2013-BerglundBDMW #regular expression

Cuts in Regular Expressions (MB, HB, FD, BvdM, BW), pp. 70–81.

DLT-2013-BertoniCD #automaton #context-free grammar #decidability #finite #linear #problem #quantum

Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.

DLT-2013-Blanchet-SadriF #complexity #on the #word

On the Asymptotic Abelian Complexity of Morphic Words (FBS, NF), pp. 94–105.

DLT-2013-Blanchet-SadriW #bound #strict

Strict Bounds for Pattern Avoidance (FBS, BW), pp. 106–117.

DLT-2013-BolligHLM #approach #automaton #learning

A Fresh Approach to Learning Register Automata (BB, PH, ML, BM), pp. 118–130.

DLT-2013-BonomoMRRS #word

Suffixes, Conjugates and Lyndon Words (SB, SM, AR, GR, MS), pp. 131–142.

DLT-2013-CurrieRS #sequence #word

Extremal Words in the Shift Orbit Closure of a Morphic Sequence (JDC, NR, KS), pp. 143–154.

DLT-2013-DassowMMM

Inner Palindromic Closure (JD, FM, RM, MM), pp. 155–166.

DLT-2013-DayRS #on the #problem

On the Dual Post Correspondence Problem (JDD, DR, JCS), pp. 167–178.

DLT-2013-FeliceN #algorithm #automaton

Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata (SDF, CN), pp. 179–190.

DLT-2013-LucaPZ #problem #word

A Coloring Problem for Sturmian and Episturmian Words (AdL, EVP, LQZ), pp. 191–202.

DLT-2013-DrosteV #context-free grammar #theorem

The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages (MD, HV), pp. 203–214.

DLT-2013-EsikI

Operational Characterization of Scattered MCFLs (ZÉ, SI), pp. 215–226.

DLT-2013-FiciLLLMP #word

Abelian Repetitions in Sturmian Words (GF, AL, TL, AL, FM, ÉPG), pp. 227–238.

DLT-2013-FulopM #composition #linear #top-down #transducer

Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers (ZF, AM), pp. 239–251.

DLT-2013-GocSS #complexity

Subword Complexity and k-Synchronization (DG, LS, JS), pp. 252–263.

DLT-2013-IbarraR #complexity

Some Decision Questions Concerning the Time Complexity of Language Acceptors (OHI, BR), pp. 264–276.

DLT-2013-JezO #ambiguity #boolean grammar

Unambiguous Conjunctive Grammars over a One-Letter Alphabet (AJ, AO), pp. 277–288.

DLT-2013-KlimaP #automaton

Alternative Automata Characterization of Piecewise Testable Languages (OK, LP), pp. 289–300.

DLT-2013-KucukSY #automaton #finite

Finite Automata with Advice Tapes (UK, ACCS, AY), pp. 301–312.

DLT-2013-KutribMW #automaton #finite #multi

One-Way Multi-Head Finite Automata with Pebbles But No States (MK, AM, MW), pp. 313–324.

DLT-2013-LibkinTV #database #graph #query #regular expression #word

Regular Expressions with Binding over Data Words for Querying Graph Databases (LL, TT, DV), pp. 325–337.

DLT-2013-CarninoL #automaton

Factorizations and Universal Automaton of ω Languages (VC, SL), pp. 338–349.

DLT-2013-LuPC

Deciding Determinism of Unary Languages Is coNP-Complete (PL, FP, HC), pp. 350–361.

DLT-2013-MarsaultS #set

Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure (VM, JS), pp. 362–373.

DLT-2013-MercasS

3-Abelian Cubes Are Avoidable on Binary Alphabets (RM, AS), pp. 374–383.

DLT-2013-MousaviS

Repetition Avoidance in Circular Factors (HM, JS), pp. 384–395.

DLT-2013-PanellaPLM #precedence

Operator Precedence ω-Languages (FP, MP, VL, DM), pp. 396–408.

DLT-2013-PrusaMO #automaton

New Results on Deterministic Sgraffito Automata (DP, FM, FO), pp. 409–419.

DLT-2013-RampersadRS #on the #word

On the Number of Abelian Bordered Words (NR, MR, PS), pp. 420–432.

DLT-2013-Regnault #automaton #probability #proving

Proof of a Phase Transition in Probabilistic Cellular Automata (DR), pp. 433–444.

DLT-2013-Shur #anti #finite #order

Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth (AMS), pp. 445–457.