Zoltán Ésik, Zoltán Fülöp
Proceedings of the 14th International Conference on Automata and Formal Languages
AFL, 2014.

@proceedings{AFL-2014,
	address       = "Szeged, Hungary",
	doi           = "10.4204/EPTCS.151",
	editor        = "Zoltán Ésik and Zoltán Fülöp",
	series        = "{EPTCS}",
	title         = "{Proceedings of the 14th International Conference on Automata and Formal Languages}",
	volume        = 151,
	year          = 2014,
}

Contents (26 items)

14 ×#automaton
4 ×#finite
4 ×#regular expression
4 ×#word
2 ×#complexity
2 ×#game studies
2 ×#infinity
2 ×#on the
2 ×#problem

AFL-2014-CarayolH #algorithm #automaton #model checking

Saturation algorithms for model-checking pushdown systems (AC, MH), pp. 1–24.

AFL-2014-GruberH #automaton #complexity #finite #regular expression #summary

From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (HG, MH), pp. 25–48.

AFL-2014-Klima #algebra #automaton #on the

On Varieties of Automata Enriched with an Algebraic Structure (OK), pp. 49–54.

AFL-2014-Loding #automaton #infinity #problem #word

Decision Problems for Deterministic Pushdown Automata on Infinite Words (CL), pp. 55–73.

AFL-2014-Maneth #equivalence #overview #problem #transducer

Equivalence Problems for Tree Transducers: A Brief Survey (SM), pp. 74–93.

AFL-2014-BarashO

Grammars with two-sided contexts (MB, AO), pp. 94–108.

AFL-2014-BerglundDM #backtracking #behaviour #regular expression

Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching (MB, FD, BvdM), pp. 109–123.

AFL-2014-BordihnKM #automaton #communication #finite #parallel

Measuring Communication in Parallel Communicating Finite Automata (HB, MK, AM), pp. 124–138.

AFL-2014-Brinda

Languages of lossless seeds (KB), pp. 139–150.

AFL-2014-BrzozowskiD13

Maximally Atomic Languages (JAB, GD), pp. 151–161.

AFL-2014-Campeanu #automaton #finite #nondeterminism

Simplifying Nondeterministic Finite Cover Automata (CC), pp. 162–173.

AFL-2014-CarapelleFGQ13 #game studies #word

Ehrenfeucht-Fraisse Games for TPTL and MTL over Non-monotonic Data Words (CC, SF, OFG, KQ), pp. 174–187.

AFL-2014-CarninoL #ambiguity #automaton #on the

On Determinism and Unambiguity of Weighted Two-way Automata (VC, SL), pp. 188–200.

AFL-2014-CevorovaJMPS #automaton

Operations on Automata with All States Final (KC, GJ, PM, MP, JS), pp. 201–215.

AFL-2014-Crespi-ReghizziP #commutative #composition

Commutative Languages and their Composition by Consensual Methods (SCR, PSP), pp. 216–230.

AFL-2014-DuS #infinity #similarity #word

Similarity density of the Thue-Morse word with overlap-free infinite binary words (CFD, JS), pp. 231–245.

AFL-2014-FernauFH #distributed #finite #hybrid

Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes (HF, RF, MH), pp. 246–260.

AFL-2014-HegedusN #word

Representations of Circular Words (LH, BN), pp. 261–270.

AFL-2014-HolzerJ #automaton #product line #regular expression

More Structural Characterizations of Some Subregular Language Families by Biautomata (MH, SJ), pp. 271–285.

AFL-2014-HutagalungLL #automaton #game studies #simulation

Buffered Simulation Games for Büchi Automata (MH, ML, ÉL), pp. 286–300.

AFL-2014-Ivan #automaton

Synchronizing weighted automata (SI), pp. 301–313.

AFL-2014-MalettiQ #automaton

Hyper-Minimization for Deterministic Weighted Tree Automata (AM, DQ), pp. 314–326.

AFL-2014-MignotSZ14a #automaton #equation

$k$-Position, Follow, Equation and $k$-C-Continuation Tree Automata Constructions (LM, NOS, DZ), pp. 327–341.

AFL-2014-Valdats #complexity #regular expression

Boolean Circuit Complexity of Regular Languages (MV), pp. 342–354.

AFL-2014-Valmari #proving #string

Character Strings and Gödel’s Incompleteness Proof (AV), pp. 355–369.

AFL-2014-Vorel #automaton #set #transitive

Subset Synchronization of Transitive Automata (VV), pp. 370–381.