Srecko Brlek, Christophe Reutenauer
Proceedings of the 20th International Conference on Developments in Language Theory
DLT, 2016.

@proceedings{DLT-2016,
	doi           = "10.1007/978-3-662-53132-7",
	editor        = "Srecko Brlek and Christophe Reutenauer",
	isbn          = "978-3-662-53131-0",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 20th International Conference on Developments in Language Theory}",
	volume        = 9840,
	year          = 2016,
}

Contents (32 items)

DLT-2016-Basten #ambiguity #automaton #detection #multi #using

Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata (HJSB), pp. 1–12.

DLT-2016-Bedon #automaton #branch

Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets (NB), pp. 13–25.

DLT-2016-Berdinsky #automation #transducer

Cayley Automatic Groups and Numerical Characteristics of Turing Transducers (DB), pp. 26–37.

DLT-2016-BhaveDKPT

A Perfect Class of Context-Sensitive Timed Languages (DB, VD, SNK, RP, AT0), pp. 38–50.

DLT-2016-BrodaMMR #automaton #regular expression

Position Automaton Construction for Regular Expressions with Intersection (SB, AM, NM, RR), pp. 51–63.

DLT-2016-CadilhacKL #approach #complexity

A Language-Theoretical Approach to Descriptive Complexity (MC, AK, KJL), pp. 64–76.

DLT-2016-CassaigneKPW #equivalence

k-Abelian Equivalence and Rationality (JC, JK, SP, MAW), pp. 77–88.

DLT-2016-ChenU

Schützenberger Products in a Category (LTC, HU), pp. 89–101.

DLT-2016-ChoH0S

Outfix-Guided Insertion - (Extended Abstract) (DJC, YSH, TN0, KS), pp. 102–113.

DLT-2016-ChoffrutG

Both Ways Rational Functions (CC, BG), pp. 114–124.

DLT-2016-DartoisJR #string #transducer

Aperiodic String Transducers (LD, IJ, PAR), pp. 125–137.

DLT-2016-Denkinger #automaton #context-free grammar #multi

An Automata Characterisation for Multiple Context-Free Languages (TD), pp. 138–150.

DLT-2016-Duck #automaton #graph #infinity #logic

Weighted Automata and Logics on Infinite Graphs (SD), pp. 151–163.

DLT-2016-EndrullisKKS #infinity #word

Degrees of Infinite Words, Polynomials and Atoms (JE, JK, JWK, AS), pp. 164–176.

DLT-2016-GasnikovS #word

Ternary Square-Free Partial Words with Many Wildcards (DG, AMS), pp. 177–189.

DLT-2016-Geffert #simulation

Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (VG), pp. 190–202.

DLT-2016-HerrmannV #automaton

Weighted Symbolic Automata with Data Storage (LH, HV), pp. 203–215.

DLT-2016-IbarraM #on the #product line

On Families of Full Trios Containing Counter Machine Languages (OHI, IM), pp. 216–228.

DLT-2016-Jirasek #regular expression #set

Non-regular Maximal Prefix-Free Subsets of Regular Languages (JJJ), pp. 229–242.

DLT-2016-JirasekJS #ambiguity #automaton #finite

Operations on Unambiguous Finite Automata (JJJ, GJ, JS), pp. 243–255.

DLT-2016-KuskeP #monad #queue

The Trace Monoids in the Queue Monoid and in the Direct Product of Two Free Monoids (DK, OP), pp. 256–267.

DLT-2016-KweeO #on the #order

On Ordered RRWW-Automata (KK, FO), pp. 268–279.

DLT-2016-LabbeL

Bispecial Factors in the Brun S-Adic System (SL0, JL0), pp. 280–292.

DLT-2016-Maletti #composition #modelling #statistics

Compositions of Tree-to-Tree Statistical Machine Translation Models (AM), pp. 293–305.

DLT-2016-ManeaNS #equation #on the #problem #strict #word

On the Solvability Problem for Restricted Classes of Word Equations (FM, DN, MLS), pp. 306–318.

DLT-2016-MichalewskiS #ambiguity #automaton

Unambiguous Büchi Is Weak (HM, MS), pp. 319–331.

DLT-2016-NowotkaS #equation #word

One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations (DN, AS), pp. 332–343.

DLT-2016-OchemR

Avoidability of Formulas with Two Variables (PO, MR), pp. 344–354.

DLT-2016-BoiretP #equivalence #linear #polynomial #transducer

Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time (AB, RP), pp. 355–367.

DLT-2016-Paul #ambiguity #automaton #finite #on the #polynomial

On Finite and Polynomial Ambiguity of Weighted Tree Automata (EP), pp. 368–379.

DLT-2016-SzykulaV #automaton

An Extremal Series of Eulerian Synchronizing Automata (MS, VV), pp. 380–392.

DLT-2016-UezatoM #approach #automaton #problem

Monoid-Based Approach to the Inclusion Problem on Superdeterministic Pushdown Automata (YU, YM), pp. 393–405.