Marie-Pierre Béal, Olivier Carton
Special Issue on Developments in Language Theory — DLT 2013
DLT, 2014.

@proceedings{DLT-J-2013,
	editor        = "Marie-Pierre Béal and Olivier Carton",
	journal       = "{International Journal of Foundations of Computer Science}",
	number        = 8,
	publisher     = "{World Scientific}",
	title         = "{Special Issue on Developments in Language Theory — DLT 2013}",
	volume        = 25,
	year          = 2014,
}

Contents (15 items)

4 ×#automaton
3 ×#finite
3 ×#multi
3 ×#on the
2 ×#context-free grammar
2 ×#decidability
2 ×#problem
2 ×#word

DLT-J-2013-Shur14 #anti #finite

Languages with a Finite antidictionary: some growth Questions (AMS), pp. 937–954.

DLT-J-2013-DrosteV14 #context-free grammar #theorem

The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages (MD, HV), pp. 955–970.

DLT-J-2013-TanV14 #graph #query #regular expression

Regular Expressions for Querying Data graphs (TT, DV), pp. 971–986.

DLT-J-2013-KucukSY14 #automaton #finite

Finite Automata with Advice Tapes (UK, ACCS, AY), pp. 987–1000.

DLT-J-2013-EsikI14

Operational Characterization of Scattered MCFLs (ZÉ, SI), pp. 1001–1016.

DLT-J-2013-AnselmoGM14 #2d #decidability

Prefix Picture codes: a Decidable class of Two-Dimensional codes (MA, DG, MM), pp. 1017–1032.

DLT-J-2013-DayRS14 #on the #problem

On the Dual Post Correspondence Problem (JDD, DR, JCS), pp. 1033–1048.

DLT-J-2013-DassowMMM14

Inner Palindromic Closure (JD, FM, RM, MM), pp. 1049–1064.

DLT-J-2013-BertoniCD14 #automaton #context-free grammar #decidability #on the #problem #quantum

On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages (AB, CC, FD), pp. 1065–1082.

DLT-J-2013-AtigKS14 #multi #order

Adjacent Ordered Multi-Pushdown Systems (MFA, KNK, PS), pp. 1083–1096.

DLT-J-2013-GocRRS14 #automation #on the #word

On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving) (DG, NR, MR, PS), pp. 1097–1110.

DLT-J-2013-CarninoL14 #automaton

Factorizations and Universal Automaton of ω-Languages (VC, SL), pp. 1111–1126.

DLT-J-2013-IbarraR14 #complexity

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

DLT-J-2013-KutribMW14a #automaton #finite #multi

Stateless One-Way Multi-Head Finite Automata with Pebbles (MK, AM, MW), pp. 1141–1160.

DLT-J-2013-BonomoMRRS14 #multi #sorting #word

Sorting conjugates and Suffixes of Words in a Multiset (SB, SM, AR, GR, MS), p. 1161–?.