Cezar Câmpeanu
Proceedings of the 23rd International Conference on Implementation and Application of Automata
CIAA, 2018.

@proceedings{CIAA-2018,
	doi           = "10.1007/978-3-319-94812-6",
	editor        = "Cezar Câmpeanu",
	isbn          = "['978-3-319-94811-9', '978-3-319-94812-6']",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 23rd International Conference on Implementation and Application of Automata}",
	volume        = 10977,
	year          = 2018,
}

Contents (27 items)

CIAA-2018-Condon #algorithm #analysis #design #network #on the

On Design and Analysis of Chemical Reaction Network Algorithms (AC), pp. 1–3.

CIAA-2018-KonstantinidisM #invariant #regular expression #transducer

Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels (SK, NM, RR, JY), pp. 4–27.

CIAA-2018-KutribMW #automaton #preprocessor #queue

Boosting Pushdown and Queue Machines by Preprocessing (MK, AM, MW), pp. 28–40.

CIAA-2018-LombardyS #automaton

The Validity of Weighted Automata (SL, JS), pp. 41–45.

CIAA-2018-AllauzenR #algorithm #automaton #finite

Algorithms for Weighted Finite Automata with Failure Transitions (CA, MDR), pp. 46–58.

CIAA-2018-AttouMZ #automaton #bottom-up

The Bottom-Up Position Tree Automaton and Its Compact Version (SA, LM, DZ), pp. 59–70.

CIAA-2018-BartholdiGKP #automaton

A New Hierarchy for Automaton Semigroups (LB, TG, IK, MP), pp. 71–83.

CIAA-2018-BerlinkovN #automaton #random

Synchronizing Random Almost-Group Automata (MVB, CN), pp. 84–96.

CIAA-2018-BjorklundDJ #automaton #comparison

A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata (JB, FD, AJ), pp. 97–108.

CIAA-2018-BrzozowskiKLS #assembly #complexity

State Complexity of Overlap Assembly (JAB, LK, BL, MS), pp. 109–120.

CIAA-2018-CognettaH #online #pattern matching #probability

Online Stochastic Pattern Matching (MC, YSH), pp. 121–132.

CIAA-2018-Davies #automaton #complexity #finite

State Complexity of Reversals of Deterministic Finite Automata with Output (SD), pp. 133–145.

CIAA-2018-DeBenedettoC #algorithm #automaton #multi #regular expression

Algorithms and Training for Weighted Multiset Automata and Regular Expressions (JD, DC0), pp. 146–158.

CIAA-2018-StasioMV #game studies

Solving Parity Games: Explicit vs Symbolic (ADS, AM, MYV), pp. 159–172.

CIAA-2018-Gerdjikov

Generalised Twinning Property (SG), pp. 173–185.

CIAA-2018-GuillonPP #automaton #self

Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (BG, GP, LP), pp. 186–197.

CIAA-2018-Hospodar0

The Ranges of Accepting State Complexities of Languages Resulting From Some Operations (MH, MH0), pp. 198–210.

CIAA-2018-IbarraM #product line

Semilinearity of Families of Languages (OHI, IM), pp. 211–222.

CIAA-2018-0002J #complexity

The Exact Complexity of Star-Complement-Star (JJ0, GJ), pp. 223–235.

CIAA-2018-KutribW #string

Parametrizing String Assembling Systems (MK, MW), pp. 236–247.

CIAA-2018-LombardyS18a #automaton

Two Routes to Automata Minimization and the Ways to Reach It Efficiently (SL, JS), pp. 248–260.

CIAA-2018-MasudaSU #algorithm #self #towards

Towards the Algorithmic Molecular Self-assembly of Fractals by Cotranscriptional Folding (YM, SS, YU), pp. 261–273.

CIAA-2018-MoldagaliyevS0 #complexity #on the

On the Values for Factor Complexity (BM, LS, FS0), pp. 274–285.

CIAA-2018-NozakiHYS #automaton #finite #using

Enumeration of Cryptarithms Using Deterministic Finite Automata (YN, DH, RY, AS), pp. 286–298.

CIAA-2018-Sakharov #approximate #automaton #parsing

One-Counter Automata for Parsing and Language Approximation (AS), pp. 299–311.

CIAA-2018-SinghK #automaton #complexity #on the

On Syntactic Complexity of Circular Semi-flower Automata (SNS, KVK), pp. 312–323.

CIAA-2018-Sinnamon #complexity #regular expression

Complexity of Proper Suffix-Convex Regular Languages (CS), pp. 324–338.