Michal Hospodár, Galina Jirásková
Proceedings of the 24th International Conference on Implementation and Application of Automata
CIAA, 2019.

@proceedings{CIAA-2019,
	doi           = "10.1007/978-3-030-23679-3",
	editor        = "Michal Hospodár and Galina Jirásková",
	isbn          = "['978-3-030-23678-6', '978-3-030-23679-3']",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 24th International Conference on Implementation and Application of Automata}",
	volume        = 11601,
	year          = 2019,
}

Contents (19 items)

CIAA-2019-Maneth #garbage collection

Static Garbage Collection (SM), pp. 3–9.

CIAA-2019-Okhotin #automaton #bound

Graph-Walking Automata: From Whence They Come, and Whither They are Bound (AO), pp. 10–29.

CIAA-2019-BakaricKR #automaton #implementation #string

Enumerated Automata Implementation of String Dictionaries (RB, DK, SR), pp. 33–44.

CIAA-2019-BaruchKS

New Approaches for Context Sensitive Flash Codes (GB, STK, DS), pp. 45–57.

CIAA-2019-BaskarRS

Dolev-Yao Theory with Associative Blindpair Operators (AB, RR, SPS), pp. 58–69.

CIAA-2019-Beier0 #automaton #finite #linear

Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract) (SB, MH0), pp. 70–82.

CIAA-2019-BjorklundDS #representation

Z-Automata for Compact and Direct Representation of Unranked Tree Languages (JB, FD, GS), pp. 83–94.

CIAA-2019-BorsottiBCM #benchmark #metric #regular expression

A Benchmark Production Tool for Regular Expressions (AB, LB, SCR, AM), pp. 95–107.

CIAA-2019-Denzumi #algorithm #sequence

New Algorithms for Manipulating Sequence BDDs (SD), pp. 108–120.

CIAA-2019-FujiyoshiP #automaton #finite #graph #set

A Simple Extension to Finite Tree Automata for Defining Sets of Labeled, Connected Graphs (AF, DP), pp. 121–132.

CIAA-2019-0001M #composition #linear #top-down #transducer

Composition Closure of Linear Weighted Extended Top-Down Tree Transducers (ZF0, AM), pp. 133–145.

CIAA-2019-HanKMS #architecture #automaton #finite #simulation

A General Architecture of Oritatami Systems for Simulating Arbitrary Finite Automata (YSH, HK, YM, SS), pp. 146–157.

CIAA-2019-Hospodar #complexity

Descriptional Complexity of Power and Positive Closure on Convex Languages (MH), pp. 158–170.

CIAA-2019-KonstantinidisM #clustering #symmetry

Partitioning a Symmetric Rational Relation into Two Asymmetric Rational Relations (SK, MM, JS), pp. 171–183.

CIAA-2019-KonstantinidisM19a #invariant #regular expression

Partial Derivatives of Regular Expressions over Alphabet-Invariant and User-Defined Labels (SK, NM, JP, RR), pp. 184–196.

CIAA-2019-KutribMW #automaton #multi

Input-Driven Multi-counter Automata (MK, AM, MW), pp. 197–208.

CIAA-2019-MrazPW #2d #pattern matching

Two-Dimensional Pattern Matching Against Basic Picture Languages (FM, DP, MW), pp. 209–221.

CIAA-2019-SmithS #2d #automaton #problem #strict

Decision Problems for Restricted Variants of Two-Dimensional Automata (TJS, KS), pp. 222–234.

CIAA-2019-TakahashiAN #streaming #string #transducer

Streaming Ranked-Tree-to-String Transducers (YT, KA, KN), pp. 235–247.