Proceedings of the 12th International Conference on Automata and Formal Languages
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Erzsébet Csuhaj-Varjú, Zoltán Ésik
Proceedings of the 12th International Conference on Automata and Formal Languages
AFL, 2008.

FLT
DBLP
Scholar
Full names Links ISxN
@proceedings{AFL-2008,
	address       = "Balatonfüred, Hungary",
	editor        = "Erzsébet Csuhaj-Varjú and Zoltán Ésik",
	isbn          = "978-963-311-367-7",
	title         = "{Proceedings of the 12th International Conference on Automata and Formal Languages}",
	year          = 2008,
}

Event page: http://www.conferences.hu/afl2008/

Contents (31 items)

AFL-2008-GeffertBS #automaton
Hyper-Minimizing Minimized Deterministic Automata (VG, AB, IS), pp. 9–30.
AFL-2008-Lohrey #problem #revisited
Compressed membership problems revisited (ML), pp. 31–53.
AFL-2008-Petre #assembly
Mathematics of gene assembly in ciliates (IP), pp. 54–55.
AFL-2008-Sakarovitch #automaton #transducer
The sequentialisation of automata and transducers (JS), pp. 56–57.
AFL-2008-AfoninK #regular expression
Semigroups of regular languages over a one letter alphabet are rational (SA, EK), pp. 61–73.
AFL-2008-AngB
Continuous Languages (TA, JAB), pp. 74–85.
AFL-2008-Bartha #automaton #equivalence #simulation
Simulation equivalence of automata and circuits (MB), pp. 86–99.
AFL-2008-Bercoff #product line
Counting of a family of column-convex rectilinear tiles (CB), pp. 100–110.
AFL-2008-BreveglieriCNR #equation #problem #satisfiability
NP-completeness of the alphabetical satisfiability problem for trace equations (LB, AC, CDN, ER), pp. 111–121.
AFL-2008-Blanchet-SadriMS #word
Counting Distinct Squares in Partial Words (FBS, RM, GS), pp. 122–133.
AFL-2008-Blanchet-SadriOR #word
Computing Weak Periods of Partial Words (FBS, TO, TDR), pp. 134–145.
AFL-2008-Cruz-ReyesK #automaton
Non-Linear Subband Coding with Cellular Automata (CCR, JK), pp. 146–157.
AFL-2008-DassowT
Subregularly Tree Controlled Grammars and Languages (JD, BT), pp. 158–169.
AFL-2008-GazdagN #theorem
A Kleene Theorem for Binoid Languages (ZG, ZLN), pp. 170–182.
AFL-2008-JurgensenM #morphism
Homomorphisms Preserving Types of Density (HJ, IM), pp. 183–194.
AFL-2008-KaminskiZ #automaton #nondeterminism
Extending finite-memory automata with non-deterministic reassignment (MK, DZ), pp. 195–207.
AFL-2008-KelemenovaB
Monocultures in eco-grammar systems (AK, TB), pp. 208–219.
AFL-2008-KlimaP
Literally idempotent languages and their varieties — two letter case (OK, LP), pp. 220–231.
AFL-2008-Kresz #automaton
Automata associated with open conjugated systems (MK), pp. 232–244.
AFL-2008-KuskeL #automation #graph #recursion
Euler paths and ends in automatic and recursive graphs (DK, ML), pp. 245–256.
AFL-2008-KutribMO #automaton #on the
On Stateless Two-Pushdown Automata and Restarting Automata (MK, HM, FO), pp. 257–268.
AFL-2008-LehtinenO #boolean grammar
Boolean grammars and gsm mappings (TL, AO), pp. 269–280.
AFL-2008-Leupold #how #matter
How to Pop a Deep PDA Matters (PL), pp. 281–291.
AFL-2008-MalcherMP #array #bound
Sublinearly Space Bounded Iterative Arrays (AM, CM, BP), pp. 292–301.
AFL-2008-ManeaMY
Some Remarks on the Hairpin Completion (FM, VM, TY), pp. 302–313.
AFL-2008-Martyugin #automaton #commutative #complexity #problem #word
Complexity of problems concerning reset words for commutative automata and automata with simple idempotents (PVM), pp. 314–324.
AFL-2008-MasopustM #automaton #multi #on the
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops (TM, AM), pp. 325–336.
AFL-2008-Pallo
Kleene revisited by Suschkewitsch (JMP), pp. 337–348.
AFL-2008-Paun
Membrane Computing: Recent Developments and Applications (GP), pp. 350–351.
AFL-2008-Roska #algorithm
Cellular Wave Computers — Algorithms for million processor computers (TR), p. 352.
AFL-2008-Szathmary #natural language
In silico Evolutionary Developmental Neurobiology and the Origin of Natural Language (ES), p. 353.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.