Accepted papers


Papers accepted for AFL '11


Francine Blanchet-Sadri, Sarah Nelson and Amelia Tebbe

On Operations Preserving Primitivity of Partial Words

Martin Čermák and Alexander Meduna

n-Accepting Restricted Pushdown Automata Systems

Janusz Brzozowski and Bo Liu

Quotient Complexity of Star-Free Languages

Xiaoxue Piao, Kai Salomaa and Sandor Vagvolgyi

Tree Homomorphisms for Unranked Trees

Oscar Ibarra and Shinnosuke Seki

Characterizations of Bounded Semilinear Languages by One-way and Two-way Deterministic Machines

Alexander Meduna, Lukáš Vrábel and Petr Zemek

On Nondeterminism in Programmed Grammars

Benedek Nagy and Friedrich Otto

Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata

Andreas Maletti and Daniel Quernheim

Hyper-minimisation of deterministic weighted finite automata over semifields

Florin Manea and Bianca Truthe

Accepting Networks of Evolutionary Processors with Subregular Filters

Yoshiyuki Kunimochi

Algebraic Properties of Petri Net Morphisms based on Place Connectivity

M. Dolores Jimenez-Lopez, Gemma Bel-Enguix and Adela Grando

Grammar Systems as Orchestras of Grammatical Services

Markus Holzer, Sebastian Jakobi and Martin Kutrib

The Chop of Languages

Gilles Benattar, Beatrice Berard, Didier Lime, John Mullins, Olivier H. Roux and Mathieu Sassolas

Channel Synthesis for Finite Transducers

Hiroshi Umeo

Recent Developments in Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata and Their State-Efficient Implementations

Lila Kari and Zhi Xu

De Bruijn Sequences Revisited

Manfred Kufleitner and Alexander Lauser

Around Dot-depth One

Stefan Borgwardt and Rafael Peñaloza

The Inclusion Problem for Weighted Automata on Infinite Trees

Attila Egri-Nagy, James D. Mitchell and Chrystopher L. Nehaniv

Algorithms for the Efficient Calculation of the Holonomy Decomposition

Attila Egri-Nagy and Chrystopher L. Nehaniv

Symmetries of Automata

Antonio Cano and Eija Jurvanen

Varieties of Languages and Frontier Check

Szabolcs Ivan and Agnes Meszaros

On Muller context-free grammars generating well-ordered words

Venkata Krishna Kanduru and T. K. Pramod Vedala

Towards Shortest Reset Words in Polynomial Time

Esther-Anna Loeliger and Chrystopher L. Nehaniv

Affordance Graphs for User-Interface Design: Application of Category-theoretic Constructs

Janusz Brzozowski, Galina Jiraskova, Baiyu Li and Joshua Smith

Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages

Szilard Zsolt Fazekas, Peter Leupold and Kayoko Shikishima-Tsuji

Avoidability of Primitive Palindromes