Proceedings of the 22nd International Conference on Developments in Language Theory
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Mizuho Hoshi, Shinnosuke Seki
Proceedings of the 22nd International Conference on Developments in Language Theory
DLT, 2018.

FLT
DBLP
Scholar
DOI
Full names Links ISxN
@proceedings{DLT-2018,
	doi           = "10.1007/978-3-319-98654-8",
	editor        = "Mizuho Hoshi and Shinnosuke Seki",
	isbn          = "['978-3-319-98653-1', '978-3-319-98654-8']",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 22nd International Conference on Developments in Language Theory}",
	volume        = 11088,
	year          = 2018,
}

Contents (45 items)

DLT-2018-GiancarloMRRS #sorting #word
Block Sorting-Based Transformations on Words: Beyond the Magic BWT (RG, GM, AR, GR, MS), pp. 1–17.
DLT-2018-I #theorem
The Runs Theorem and Beyond (TI), pp. 18–23.
DLT-2018-Khoussainov #game studies
A Brief Excursion to Parity Games (BK), pp. 24–35.
DLT-2018-Okhotin #boolean grammar
A Tale of Conjunctive Grammars (AO), pp. 36–59.
DLT-2018-Perrin
Groups, Languages and Dendric Shifts (DP), pp. 60–73.
DLT-2018-Winslow #problem
Some Open Problems in Polyomino Tilings (AW), pp. 74–82.
DLT-2018-AlmagorCMP #automaton
Weak Cost Register Automata Are Still Powerful (SA, MC, FM, GAP), pp. 83–95.
DLT-2018-BaudruR #transducer
From Two-Way Transducers to Regular Function Expressions (NB, PAR), pp. 96–108.
DLT-2018-Beier0 #automaton #decidability #finite
Decidability of Right One-Way Jumping Finite Automata (SB, MH0), pp. 109–120.
DLT-2018-BellLS #approximate #regular expression
Additive Number Theory via Approximation by Regular Languages (JPB, TFL, JOS), pp. 121–132.
DLT-2018-Bjorklund
Tree-to-Graph Transductions with Scope (JB), pp. 133–144.
DLT-2018-BondarV #automaton
A Characterization of Completely Reachable Automata (EAB, MVV), pp. 145–155.
DLT-2018-BrancoP
Inequalities for One-Step Products (MJJB, JÉP), pp. 156–168.
DLT-2018-CarpiD #commutative #context-free grammar #equivalence #on the
On the Commutative Equivalence of Context-Free Languages (AC, FD), pp. 169–181.
DLT-2018-CartonP #theorem #word
Simon's Theorem for Scattered Words (OC, MP), pp. 182–193.
DLT-2018-CatalanoJ #matrix #probability #set
The Synchronizing Probability Function for Primitive Sets of Matrices (CC, RMJ), pp. 194–205.
DLT-2018-CaucalR #automaton
Recognizability for Automata (DC, CR), pp. 206–218.
DLT-2018-ChoHKS
Site-Directed Deletion (DJC, YSH, HK, KS), pp. 219–230.
DLT-2018-ColbournDLS #regular expression
Counting Subwords and Regular Languages (CJC, RED, TFL, JOS), pp. 231–242.
DLT-2018-Crespi-Reghizzi #automaton #graph
Deque Languages, Automata and Planar Graphs (SCR, PSP), pp. 243–255.
DLT-2018-Davies #approach #complexity #formal method
A General Approach to State Complexity of Operations: Formalization and Limitations (SD), pp. 256–268.
DLT-2018-DayFMNS #on the
On Matching Generalised Repetitive Patterns (JDD, PF, FM, DN, MLS), pp. 269–281.
DLT-2018-OliveiraW #polynomial
Intersection Non-emptiness and Hardness Within Polynomial Time (MdOO, MW), pp. 282–290.
DLT-2018-EberhardEH #complexity #problem
Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars (SE, GE, SH), pp. 291–303.
DLT-2018-FiliotMR #automaton #logic
A Pattern Logic for Automata with Outputs (EF, NM, JFR), pp. 304–317.
DLT-2018-Fleischer #finite #problem
The Intersection Problem for Finite Semigroups (LF), pp. 318–329.
DLT-2018-GonzeJ #automaton #on the #reachability #set
On Completely Reachable Automata and Subset Reachability (FG, RMJ), pp. 330–341.
DLT-2018-Gruber0W #finite #on the #problem
On Minimal Grammar Problems for Finite Languages (HG, MH0, SW), pp. 342–353.
DLT-2018-GuillonKMP #automaton #transducer
Reversible Pushdown Transducers (BG, MK, AM, LP), pp. 354–365.
DLT-2018-GuillonPPP #automaton #linear
Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time (BG, GP, LP, DP), pp. 366–378.
DLT-2018-GusevJP #automaton #independence
Dynamics of the Independence Number and Automata Synchronization (VVG, RMJ, DP), pp. 379–391.
DLT-2018-HanK0S #problem #regular expression #string
Closest Substring Problems for Regular Languages (YSH, SKK, TN0, KS), pp. 392–403.
DLT-2018-0001JJ #automaton #complexity #finite #problem #self #verification
Computational Complexity of Decision Problems on Self-verifying Finite Automata (MH0, SJ, JJJ), pp. 404–415.
DLT-2018-IbarraM #automaton #stack
Generalizations of Checking Stack Automata: Characterizations and Hierarchies (OHI, IM), pp. 416–428.
DLT-2018-IbarraMR #on the
On Counting Functions of Languages (OHI, IM, BR), pp. 429–440.
DLT-2018-JiraskovaO #automaton #bound #complexity #towards
Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata (GJ, AO), pp. 441–452.
DLT-2018-KarhumakiPW #on the
On Abelian Subshifts (JK, SP, MAW), pp. 453–464.
DLT-2018-KoNP #integer #nondeterminism #polynomial #problem #reachability
Reachability Problems in Nondeterministic Polynomial Maps on the Integers (SKK, RN, IP), pp. 465–477.
DLT-2018-LandwehrL #automaton #constraints
Projection for Büchi Tree Automata with Constraints Between Siblings (PL, CL), pp. 478–490.
DLT-2018-LoffMR #parsing expression grammar #power of
The Computational Power of Parsing Expression Grammars (BL, NM, RR), pp. 491–502.
DLT-2018-LodingP #ambiguity #automaton #on the
On Finitely Ambiguous Büchi Automata (CL, AP), pp. 503–515.
DLT-2018-Michielini #finite #first-order #logic #problem #word
Uniformization Problem for Variants of First Order Logic over Finite Words (VM), pp. 516–528.
DLT-2018-Otto #automaton #on the #order
On Deterministic Ordered Restart-Delete Automata (FO), pp. 529–540.
DLT-2018-Rabinovich #ambiguity #automaton
Complementation of Finitely Ambiguous Büchi Automata (AR), pp. 541–552.
DLT-2018-Rubtsov #context-free grammar
A Structural Lemma for Deterministic Context-Free Languages (AAR), pp. 553–565.

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.