Proceedings of the 18th International Conference on Developments in Language Theory
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Arseny M. Shur, Mikhail V. Volkov
Proceedings of the 18th International Conference on Developments in Language Theory
DLT, 2014.

Full names Links ISxN
	address       = "Ekaterinburg, Russia",
	doi           = "10.1007/978-3-319-09698-8",
	editor        = "Arseny M. Shur and Mikhail V. Volkov",
	isbn          = "978-3-319-09697-1",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 18th International Conference on Developments in Language Theory}",
	volume        = 8633,
	year          = 2014,

Contents (30 items)

DLT-2014-BerdinskyK #automation #graph #on the #transitive
On Automatic Transitive Graphs (DB, BK), pp. 1–12.
DLT-2014-BrzozowskiS #bound #complexity
Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals (JAB, MS), pp. 13–24.
DLT-2014-FeliceN #algorithm #automaton #complexity #on the
On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States (SDF, CN), pp. 25–36.
DLT-2014-HanKS #complexity
State Complexity of Deletion (YSH, SKK, KS), pp. 37–48.
DLT-2014-AlmeidaR #automaton
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory (JA, ER), pp. 49–60.
DLT-2014-Berlinkov #algorithm #automaton #on the #problem
On Two Algorithmic Problems about Synchronizing Automata — (MVB), pp. 61–67.
DLT-2014-Gusev #automaton #random
Synchronizing Automata with Random Inputs — (VVG), pp. 68–75.
DLT-2014-Sinya #automaton #finite #graph
Graph Spectral Properties of Deterministic Finite Automata — (RS), pp. 76–83.
DLT-2014-OkhotinS #automaton #nondeterminism
Input-Driven Pushdown Automata with Limited Nondeterminism — (AO, KS), pp. 84–102.
DLT-2014-EngelfrietMS #how #top-down #transducer
How to Remove the Look-Ahead of Top-Down Tree Transducers (JE, SM, HS), pp. 103–115.
DLT-2014-TorreNP #automaton #bound
Scope-Bounded Pushdown Languages (SLT, MN, GP), pp. 116–128.
DLT-2014-ReynierT #automaton #transducer
Visibly Pushdown Transducers with Well-Nested Outputs (PAR, JMT), pp. 129–141.
DLT-2014-Schmid #regular expression
Characterising REGEX Languages by Regular Languages Equipped with Factor-Referencing (MLS), pp. 142–153.
DLT-2014-Sorokin #context-free grammar
Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars (AS), pp. 154–165.
Aperiodic Tilings and Entropy (BD, GG, AG), pp. 166–177.
DLT-2014-EhlersMMN #pattern matching
k-Abelian Pattern Matching (TE, FM, RM, DN), pp. 178–190.
DLT-2014-KarhumakiP #on the #word
On k-Abelian Palindromic Rich and Poor Words (JK, SP), pp. 191–202.
DLT-2014-KarhumakiSZ #equivalence #theorem
Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence (JK, AS, LQZ), pp. 203–214.
DLT-2014-KociumakaRRW #standard #word
Maximum Number of Distinct and Nonequivalent Nonstandard Squares in a Word (TK, JR, WR, TW), pp. 215–226.
Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings (BLG, NO), pp. 227–238.
DLT-2014-SprungerTEM #sequence
Eigenvalues and Transduction of Morphic Sequences (DS, WT, JE, LSM), pp. 239–251.
Breadth-First Serialisation of Trees and Rational Languages — (VM, JS), pp. 252–259.
DLT-2014-KutribM #automaton #communication
Measuring Communication in Automata Systems — (MK, AM), pp. 260–274.
DLT-2014-Weil #algebra #logic
From Algebra to Logic: There and Back Again The Story of a Hierarchy — (PW), pp. 275–278.
DLT-2014-DayRS #pattern matching
Closure Properties of Pattern Languages (JDD, DR, MLS), pp. 279–290.
DLT-2014-HolzerJ #automaton
Minimal and Hyper-Minimal Biautomata — (MH, SJ), pp. 291–302.
DLT-2014-KutribMW #automaton #set
Deterministic Set Automata (MK, AM, MW), pp. 303–314.
The Minimum Amount of Useful Space: New Results and New Directions (KR, AY), pp. 315–326.
DLT-2014-YakaryilmazSD #quantum #verification
Debates with Small Transparent Quantum Verifiers (AY, ACCS, HGD), pp. 327–338.
DLT-2014-DickyJ #finite #infinity #word
Embedding Finite and Infinite Words into Overlapping Tiles — (AD, DJ), pp. 339–347.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.