Arnaud Carayol, Cyril Nicaud
Proceedings of the 22nd International Conference on Implementation and Application of Automata
CIAA, 2017.

@proceedings{CIAA-2017,
	doi           = "10.1007/978-3-319-60134-2",
	editor        = "Arnaud Carayol and Cyril Nicaud",
	isbn          = "['978-3-319-60133-5', '978-3-319-60134-2']",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 22nd International Conference on Implementation and Application of Automata}",
	volume        = 10329,
	year          = 2017,
}

Contents (20 items)

CIAA-2017-Cortier #how #logic

Electronic Voting: How Logic Can Help (VC), p. xi-xii.

CIAA-2017-Larsen #energy #game studies

Timed and Untimed Energy Games (KGL), p. xiii-xvi.

CIAA-2017-Pous #algorithm #automaton #induction

CoInductive Automata Algorithms (DP), p. xvii-xviii.

CIAA-2017-AcetoAFIK #complexity #monitoring #on the

On the Complexity of Determinizing Monitors (LA, AA, AF, AI, SÖK), pp. 1–13.

CIAA-2017-BerglundMWW #on the #regular expression #semantics

On the Semantics of Atomic Subgroups in Practical Regular Expressions (MB, BvdM, BWW, NW), pp. 14–26.

CIAA-2017-BjorklundBE #graph #on the #order

On the Regularity and Learnability of Ordered DAG Languages (HB, JB, PE), pp. 27–39.

CIAA-2017-Bordihn0 #automaton #finite #nondeterminism #on the

On the Number of Active States in Deterministic and Nondeterministic Finite Automata (HB, MH0), pp. 40–51.

CIAA-2017-BrzozowskiS #complexity #regular expression

Complexity of Proper Prefix-Convex Regular Languages (JAB, CS), pp. 52–63.

CIAA-2017-CauliP #calculus #equivalence #probability #μ-calculus

Equivalence of Probabilistic μ-Calculus and p-Automata (CC, NP), pp. 64–75.

CIAA-2017-FerensS #complexity #regular expression

Complexity of Bifix-Free Regular Languages (RF, MS), pp. 76–88.

CIAA-2017-FernauKR

Computational Completeness of Path-Structured Graph-Controlled Insertion-Deletion Systems (HF, LK, IR), pp. 89–100.

CIAA-2017-FijalkowGKK #automaton #monad #named

Stamina: Stabilisation Monoids in Automata Theory (NF, HG, EK, DK), pp. 101–112.

CIAA-2017-GerdjikovMS #finite #functional #transducer

A Simple Method for Building Bimachines from Functional Finite-State Transducers (SG, SM, KUS), pp. 113–125.

CIAA-2017-HanK #distance

Alignment Distance of Regular Tree Languages (YSH, SKK), pp. 126–137.

CIAA-2017-HospodarJM #complexity #nondeterminism

Nondeterministic Complexity of Operations on Free and Convex Languages (MH, GJ, PM), pp. 138–150.

CIAA-2017-KutribMW #finite #state machine

Transducing Reversibly with Finite State Machines (MK, AM, MW), pp. 151–162.

CIAA-2017-DandoL #automaton

From Hadamard Expressions to Weighted Rotating Automata and Back (LMD, SL), pp. 163–174.

CIAA-2017-Massazza #on the

On the Conjecture ℒDFCM ⊊ RCM (PM), pp. 175–187.

CIAA-2017-Ryzhikov #automaton #problem

Synchronization Problems in Automata Without Non-trivial Cycles (AR), pp. 188–200.

CIAA-2017-SzykulaW #complexity

Syntactic Complexity of Bifix-Free Languages (MS, JW), pp. 201–212.