AFL 2008

The 12th International Conference on
Automata and Formal Languages
May 27-30, 2008, Balatonfüred, Hungary

Accepted Papers


Thomas Ang and Janusz Brzozowski. Continuous Languages

Miklós Bartha. Simulation equivalence of automata and circuits

Christiane Bercoff. Counting of a family of column-convex rectilinear tiles

Francine Blanchet-Sadri, Robert Mercas and Geoffrey Scott. Counting Distinct Squares in Partial Words

Francine Blanchet-Sadri, Taktin Oey and Timothy Rankin. Computing Weak Periods on Partial words

Carlos Cruz-Reyes and Jarkko Kari. Non-Linear Subband Coding with Cellular Automata

Jürgen Dassow and Bianca Truthe. Subregularly Tree Controlled Grammars and Languages

Helmut Jürgensen and Ian McQuillan. Homomorphisms Preserving Types of Density

Michael Kaminski and Daniel Zeitlin. Extending finite-memory automata with non-deterministic reassignment

Elena Khazova and Sergey Afonin. Semigroups of regular languages over one letter alphabet are rational

Alica Kelemenova and Tamas Bartik. Monocultures in Eco-grammar Systems

Miklós Krész. Automata associated with open conjugated systems

Dietrich Kuske and Markus Lohrey. Euler paths and ends in automatic and recursive graphs

Martin Kutrib, Hartmut Messerschmidt and Friedrich Otto. On stateless two-pushdown automata and restarting automata

Tommi Lehtinen and Alexander Okhotin. Boolean grammars and gsm mappings

Peter Leupold. How to Pop a Deep PDA Matters

Andreas Malcher, Carlo Mereghetti and Beatrice Palano. Sublinearly Space Bounded Iterative Arrays

Florin Manea, Victor Mitrana and Takashi Yokomori. Some Remarks on the Hairpin Completion

Pavel Martyugin. Complexity of problems concerning reset words for commutative automata and automata with simple idempotents

Tomas Masopust and Alexander Meduna. On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops

Zoltán L. Németh and Zsolt Gazdag. A Kleene Theorem for Binoid Languages

Claudia Nuccio, Luca Breveglieri, Alessandra Cherubini and Emanuele Rodaro. NP-completeness for the restricted satisfiability problem of trace equations

Jean Pallo. Kleene revisited by Suschkewitsch

Libor Polak and Ondrej Klima. Literally idempotent languages and their varieties - two letter case









Maintained by the author.