Piotrek Hofman, Michal Skrzypczak
Proceedings of the 23rd International Conference on Developments in Language Theory
DLT, 2019.

@proceedings{DLT-2019,
	doi           = "10.1007/978-3-030-24886-4",
	editor        = "Piotrek Hofman and Michal Skrzypczak",
	isbn          = "['978-3-030-24885-7', '978-3-030-24886-4']",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 23rd International Conference on Developments in Language Theory}",
	volume        = 11647,
	year          = 2019,
}

Contents (23 items)

DLT-2019-Boker #automaton

Inherent Size Blowup in ω-Automata (UB), pp. 3–17.

DLT-2019-Jez #constraints #unification

Deciding Context Unification (with Regular Constraints) (AJ), pp. 18–40.

DLT-2019-Seki #architecture

Single-Stranded Architectures for Computing (SS), pp. 41–56.

DLT-2019-AzfarCCJ #bound #linear #matrix #set

A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matrices (UA, CC, LC, RMJ), pp. 59–73.

DLT-2019-KariRV #automaton #finite #rank #word

Words of Minimum Rank in Deterministic Finite Automata (JK, AR, AV), pp. 74–87.

DLT-2019-DobronravovDO #automaton #finite #on the #string

On the Length of Shortest Strings Accepted by Two-Way Finite Automata (ED, ND, AO), pp. 88–99.

DLT-2019-YenY #finite #transducer

Characterizing the Valuedness of Two-Way Finite Transducers (DDY, HCY), pp. 100–112.

DLT-2019-GeffertBS #automaton #distance #edit distance

Input-Driven Pushdown Automata for Edit Distance Neighborhood (VG, ZB, AS), pp. 113–126.

DLT-2019-CheonHKS

The Relative Edit-Distance Between Two Input-Driven Languages (HC, YSH, SKK, KS), pp. 127–139.

DLT-2019-MrazO #automaton #on the

On Shrinking Restarting Automata of Window Size One and Two (FM, FO), pp. 140–153.

DLT-2019-Gao #bound #complexity #education #pattern matching

The Teaching Complexity of Erasing Pattern Languages with Bounded Variable Frequency (ZG), pp. 154–167.

DLT-2019-BhaveKPT #bound #context-sensitive grammar #on the

On Timed Scope-Bounded Context-Sensitive Languages (DB, SNK, RP, AT0), pp. 168–181.

DLT-2019-GastinMG #logic #regular expression

Logics for Reversible Regular Languages and Semigroups with Involution (PG, AM, RG), pp. 182–191.

DLT-2019-IostiK

Eventually Safe Languages (SI, DK), pp. 192–205.

DLT-2019-KuperbergPP #algorithm #automaton #induction

Coinductive Algorithms for Büchi Automata (DK, LP, DP), pp. 206–220.

DLT-2019-Massazza

Hole-Free Partially Directed Animals (PM), pp. 221–233.

DLT-2019-Frid #bound

First Lower Bounds for Palindromic Length (AEF), pp. 234–243.

DLT-2019-AmbrozP #on the #sequence

On Palindromic Length of Sturmian Sequences (PA, EP), pp. 244–250.

DLT-2019-Saarela #word

Separating Many Words by Counting Occurrences of Factors (AS), pp. 251–264.

DLT-2019-DayFMN #word

k-Spectra of Weakly-c-Balanced Words (JDD, PF, FM, DN), pp. 265–277.

DLT-2019-Lejeune0R #complexity #word

Computing the k-binomial Complexity of the Thue-Morse Word (ML, JL0, MR), pp. 278–291.

DLT-2019-BroughCP #context-free grammar #problem #word

Context-Free Word Problem Semigroups (TB, AJC, MP), pp. 292–305.

DLT-2019-GoldwurmLV #analysis #component #modelling #statistics

Analysis of Symbol Statistics in Bicomponent Rational Models (MG, JL, MV), pp. 306–318.