12. AFL 2008:
Balatonfüred, Hungary
Erzsébet Csuhaj-Varjú, Zoltán Ésik (Eds.):
Automata and Formal Languages, 12th International Conference, AFL 2008, Balatonfüred, Hungary, May 27-30, 2008, Proceedings.
2008, ISBN 978-963-311-367-7 
Invited Presentations
Contributions
- Sergey Afonin, Elena Khazova:
Semigroups of regular languages over a one letter alphabet are rational.
61-73
- Thomas Ang, Janusz A. Brzozowski:
Continuous Languages.
74-85
- Miklós Bartha:
Simulation equivalence of automata and circuits.
86-99
- Christiane Bercoff:
Counting of a family of column-convex rectilinear tiles.
100-110
- Luca Breveglieri, Alessandra Cherubini, Claudia Di Nucci, Emanuele Rodaro:
NP-completeness of the alphabetical satisfiability problem for trace equations.
111-121
- Francine Blanchet-Sadri, Robert Mercas, Geoffrey Scott:
Counting Distinct Squares in Partial Words.
122-133
- Francine Blanchet-Sadri, Taktin Oey, Timothy D. Rankin:
Computing Weak Periods of Partial Words.
134-145
- Carlos Cruz-Reyes, Jarkko Kari:
Non-Linear Subband Coding with Cellular Automata.
146-157
- Jürgen Dassow, Bianca Truthe:
Subregularly Tree Controlled Grammars and Languages.
158-169
- Zsolt Gazdag, Zoltán L. Németh:
A Kleene Theorem for Binoid Languages.
170-182
- Helmut Jürgensen, Ian McQuillan:
Homomorphisms Preserving Types of Density.
183-194
- Michael Kaminski, Daniel Zeitlin:
Extending finite-memory automata with non-deterministic reassignment (Extended abstract).
195-207
- Alica Kelemenová, Tomás Bartík:
Monocultures in eco-grammar systems.
208-219
- Ondrej Klíma, Libor Polák:
Literally idempotent languages and their varieties - two letter case.
220-231
- Miklós Krész:
Automata associated with open conjugated systems.
232-244
- Dietrich Kuske, Markus Lohrey:
Euler paths and ends in automatic and recursive graphs.
245-256
- Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto:
On Stateless Two-Pushdown Automata and Restarting Automata.
257-268
- Tommi Lehtinen, Alexander Okhotin:
Boolean grammars and gsm mappings.
269-280
- Peter Leupold:
How to Pop a Deep PDA Matters.
281-291
- Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Sublinearly Space Bounded Iterative Arrays.
292-301
- Florin Manea, Victor Mitrana, Takashi Yokomori:
Some Remarks on the Hairpin Completion.
302-313
- Pavel V. Martyugin:
Complexity of problems concerning reset words for commutative automata and automata with simple idempotents.
314-324
- Tomás Masopust, Alexander Meduna:
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops.
325-336
- Jean Marcel Pallo:
Kleene revisited by Suschkewitsch.
337-348
Satellite Event "Challenges in Computing and Complexity"
- Gheorghe Paun:
Membrane Computing: Recent Developments and Applications (Extended Abstract).
350-351
- Tamás Roska:
Cellular Wave Computers - Algorithms for million processor computers (Abstract).
352
- Eörs Szathmáry:
In silico Evolutionary Developmental Neurobiology and the Origin of Natural Language (Abstract).
353
Last update Fri May 24 00:00:42 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
