Pál Dömösi, Szabolcs Iván
Proceedings of the 13th International Conference on Automata and Formal Languages
AFL, 2011.

@proceedings{AFL-2011,
	address       = "Debrecen, Hungary",
	editor        = "Pál Dömösi and Szabolcs Iván",
	isbn          = "978-615-5097-19-5",
	title         = "{Proceedings of the 13th International Conference on Automata and Formal Languages}",
	year          = 2011,
}

Event page: http://www.nyf.hu/afl11/

Contents (30 items)

5 ×#automaton
5 ×#word
3 ×#finite
3 ×#on the
2 ×#algorithm
2 ×#complexity
2 ×#infinity
2 ×#morphism
2 ×#problem
2 ×#strict

AFL-2011-Blanchet-Sadri #problem #word

Open Problems on Avoidable Patterns in Partial Words (FBS), pp. 12–24.

AFL-2011-Choffrut #finite #infinity #on the #word

On relations of finite words over infinite alphabets (CC), pp. 25–27.

AFL-2011-Ito #strict

K-Restricted Duplication Closure of Languages (MI), pp. 28–33.

AFL-2011-Maletti

Notes on Hyper-minimization (AM), pp. 34–49.

AFL-2011-Pin #equation

Equational descriptions of languages (JÉP), pp. 50–63.

AFL-2011-EnguixGJ

Grammar Systems as Orchestras of Grammatical Services (GBE, MAG, MDJL), pp. 65–78.

AFL-2011-BenattarBLMRS #finite #synthesis #transducer

Channel Synthesis for Finite Transducers (GB, BB, DL, JM, OHR, MS), pp. 79–92.

AFL-2011-Blanchet-SadriNT #on the #word

On Operations Preserving Primitivity of Partial Words with One Hole (FBS, SN, AT), pp. 93–107.

AFL-2011-BorgwardtP #automaton #infinity #problem

The Inclusion Problem for Weighted Automata on Infinite Trees (SB, RP), pp. 108–122.

AFL-2011-BrzozowskiJLS #complexity #regular expression

Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages (JAB, GJ, BL, JS), pp. 123–137.

AFL-2011-BrzozowskiL #complexity

Quotient Complexity of Star-Free Languages (JAB, BL), pp. 138–152.

AFL-2011-CanoJ

Varieties of Languages and Frontier Check (AC, EJ), pp. 153–167.

AFL-2011-CermakM #automaton #strict

n-Accepting Restricted Pushdown Automata Systems (MC, AM), pp. 168–183.

AFL-2011-FazekasLS

Palindromes and Primitivity (SZF, PL, KST), pp. 184–196.

AFL-2011-HolzerJK

The Chop of Languages (MH, SJ, MK), pp. 197–210.

AFL-2011-IbarraS #bound #linear

Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic Machines (OHI, SS), pp. 211–224.

AFL-2011-IvanM #context-free grammar #generative #word

Müller context-free grammars generating well-ordered words (SI, ÁM), pp. 225–240.

AFL-2011-KariX #revisited #sequence

De Bruijn Sequences Revisited (LK, ZX), pp. 241–254.

AFL-2011-KufleitnerL

Around Dot-Depth One (MK, AL), pp. 255–269.

AFL-2011-Kunimochi #algebra #morphism #petri net

Algebraic Properties of Petri Net Morphisms based on Place Connectivity (YK), pp. 270–284.

AFL-2011-MalettiQ #automaton #finite

Hyper-minimisation of deterministic weighted finite automata over semifields (AM, DQ), pp. 285–299.

AFL-2011-ManeaT #network

Accepting Networks of Evolutionary Processors with Subregular Filters (FM, BT), pp. 300–314.

AFL-2011-MedunaVZ #nondeterminism #on the

On Nondeterminism in Programmed Grammars (AM, LV, PZ), pp. 315–327.

AFL-2011-NagyO

Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata (BN, FO), pp. 328–342.

AFL-2011-PiaoSV #morphism

Tree Homomorphisms for Unranked Trees (XP, KS, SV), pp. 343–357.

AFL-2011-PramodK #polynomial #towards #word

Towards Shortest Synchronizing Words in Polynomial Time (VTKP, KVK), pp. 358–367.

AFL-2011-Umeo #2d #algorithm #automaton #implementation

Recent Developments in Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata and Their State-Efficient Implementations (HU), pp. 368–387.

AFL-2011-Egri-NagyMN #algorithm #composition #performance

Algorithms for the Efficient Calculation of the Holonomy Decomposition (AEN, JDM, CLN), pp. 389–390.

AFL-2011-Egri-NagyN #automaton #symmetry

Symmetries of Automata (AEN, CLN), p. 391.

AFL-2011-LoeligerN #design #graph #user interface

Affordance Graphs for User Interface Design: Application of Category-theoretic Constructs (EAL, CLN), pp. 392–394.