Igor Potapov
Proceedings of the 19th International Conference on Developments in Language Theory
DLT, 2015.

@proceedings{DLT-2015,
	address       = "Liverpool, United Kingdom",
	doi           = "10.1007/978-3-319-21500-6",
	editor        = "Igor Potapov",
	isbn          = "978-3-319-21499-3",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 19th International Conference on Developments in Language Theory}",
	volume        = 9168,
	year          = 2015,
}

Contents (34 items)

9 ×#automaton
6 ×#complexity
5 ×#on the
5 ×#word
4 ×#finite
3 ×#infinity
2 ×#bound
2 ×#monad
2 ×#permutation
2 ×#problem

DLT-2015-Bojanczyk #monad

Recognisable Languages over Monads (MB), pp. 1–13.

DLT-2015-Dehornoy #normalisation #overview #polynomial

Garside and Quadratic Normalisation: A Survey (PD), pp. 14–45.

DLT-2015-Lohrey #grammarware

Grammar-Based Tree Compression (ML), pp. 46–57.

DLT-2015-AlmeidaBKK #decidability #on the

On Decidability of Intermediate Levels of Concatenation Hierarchies (JA, JB, OK, MK), pp. 58–70.

DLT-2015-AvgustinovichFP #complexity #infinity #permutation

Ergodic Infinite Permutations of Minimal Complexity (SVA, AEF, SP), pp. 71–84.

DLT-2015-BannaiGIKKPPS

Diverse Palindromic Factorization Is NP-complete (HB, TG, SI, JK, DK, MP, SJP, SS), pp. 85–96.

DLT-2015-BellRS #formal method

Factorization in Formal Languages (PCB, DR, JS), pp. 97–107.

DLT-2015-BerwangerB #game studies

Consensus Game Acceptors (DB, MvdB), pp. 108–119.

DLT-2015-BianchiHK #automaton #liveness #on the #problem

On the Size of Two-Way Reasonable Automata for the Liveness Problem (MPB, JH, IK), pp. 120–131.

DLT-2015-Blanchet-SadriR #word

Squareable Words (FBS, AR), pp. 132–142.

DLT-2015-BrandlS #analysis #automaton #complexity #finite #monad

Complexity Analysis: Transformation Monoids of Finite Automata (CB, HUS), pp. 143–154.

DLT-2015-BrlekLP #complexity

Palindromic Complexity of Trees (SB, NL, XP), pp. 155–166.

DLT-2015-BealH #finite

Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts (MPB, PH), pp. 167–178.

DLT-2015-BoassonC #word

Transfinite Lyndon Words (LB, OC), pp. 179–190.

DLT-2015-CurrieMN #permutation

Unary Patterns with Permutations (JDC, FM, DN), pp. 191–202.

DLT-2015-CzybaST #automaton #finite #infinity #modelling

Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (CC, CS, WT), pp. 203–214.

DLT-2015-DolceP #set

Enumeration Formulæ in Neutral Sets (FD, DP), pp. 215–227.

DLT-2015-EremondiIM #on the

On the Density of Context-Free and Counter Languages (JE, OHI, IM), pp. 228–239.

DLT-2015-EsikFL #algebra

*-Continuous Kleene ω-Algebras (ZÉ, UF, AL), pp. 240–251.

DLT-2015-GainutdinovaY #automaton #probability #problem #quantum

Unary Probabilistic and Quantum Automata on Promise Problems (AG, AY), pp. 252–263.

DLT-2015-HanKS #fault

Generalizations of Code Languages with Marginal Errors (YSH, SKK, KS), pp. 264–275.

DLT-2015-HolzerJK #automaton #finite

Minimal Reversible Deterministic Finite Automata (MH, SJ, MK), pp. 276–287.

DLT-2015-JeckerF #multi #word

Multi-sequential Word Relations (IJ, EF), pp. 288–299.

DLT-2015-JirasekJ #bound

The Boundary of Prefix-Free Languages (JJ, GJ), pp. 300–312.

DLT-2015-KlimannPS #automaton #infinity

A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group (IK, MP, DS), pp. 313–325.

DLT-2015-FengLQ #word

Path Checking for MTL and TPTL over Data Words (SF, ML, KQ), pp. 326–339.

DLT-2015-KrebsLL #on the

On Distinguishing NC¹ and NL (AK, KJL, ML), pp. 340–351.

DLT-2015-Marsault #automaton

Surminimisation of Automata (VM), pp. 352–363.

DLT-2015-MasopustT #automaton #complexity #on the #testing

On the Complexity of k-Piecewise Testability and the Depth of Automata (TM, MT), pp. 364–376.

DLT-2015-MasakovaPS #word

Interval Exchange Words and the Question of Hof, Knill, and Simon (ZM, EP, SS), pp. 377–388.

DLT-2015-NgRS #approximate #complexity #pattern matching

State Complexity of Neighbourhoods and Approximate Pattern Matching (TN, DR, KS), pp. 389–400.

DLT-2015-OttoK #automaton #order

Deterministic Ordered Restarting Automata that Compute Functions (FO, KK), pp. 401–412.

DLT-2015-Perevoshchikov #logic

Weight Assignment Logic (VP), pp. 413–425.

DLT-2015-Yamakami #bound #complexity #quantum

Complexity Bounds of Constant-Space Quantum Computation — (TY), pp. 426–438.