researchr
explore
Tags
Journals
Conferences
Authors
Profiles
Groups
calendar
New Conferences
Events
Deadlines
search
search
You are not signed in
Sign in
Sign up
Links
Filter by Year
OR
AND
NOT
1
2008
2011
Filter by Tag
Filter by Author
[+]
OR
AND
NOT
1
Alessandra Cherubini
Alexander Lauser
Alexander Meduna
Alexander Okhotin
Alica Kelemenová
Amelia Tebbe
Andreas Malcher
Andreas Maletti
Andrew Badr
Antonio Cano
Attila Egri-Nagy
Bianca Truthe
Chrystopher L. Nehaniv
Florin Manea
Francine Blanchet-Sadri
Friedrich Otto
Janusz A. Brzozowski
Markus Lohrey
Martin Kutrib
Peter Leupold
Filter by Top terms
[+]
OR
AND
NOT
1
abstract
accepting
algorithms
automata
cellular
complexity
deterministic
finite
free
grammars
hyper
languages
one
partial
problems
pushdown
revisited
systems
two
words
AFL (afl)
Editions
Publications
Viewing Publication 1 - 63 from 63
2011
Channel Synthesis for Finite Transducers
Gilles Benattar
,
Béatrice Bérard
,
Didier Lime
,
John Mullins
,
Olivier H. Roux
,
Mathieu Sassolas
.
afl 2011
:
79-92
On Operations Preserving Primitivity of Partial Words with One Hole
Francine Blanchet-Sadri
,
Sarah Nelson
,
Amelia Tebbe
.
afl 2011
:
93-107
Open Problems on Avoidable Patterns in Partial Words
Francine Blanchet-Sadri
.
afl 2011
:
12-24
The Inclusion Problem for Weighted Automata on Infinite Trees
Stefan Borgwardt
,
Rafael Peñaloza
.
afl 2011
:
108-122
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages
Janusz A. Brzozowski
,
Galina Jirásková
,
Baiyu Li
,
Joshua Smith
.
afl 2011
:
123-137
Quotient Complexity of Star-Free Languages
Janusz A. Brzozowski
,
Bo Liu
.
afl 2011
:
138-152
Varieties of Languages and Frontier Check
Antonio Cano
,
Eija Jurvanen
.
afl 2011
:
153-167
n-Accepting Restricted Pushdown Automata Systems
Martin Cermák
,
Alexander Meduna
.
afl 2011
:
168-183
On relations of finite words over infinite alphabets
Christian Choffrut
.
afl 2011
:
25-27
Automata and Formal Languages, 13th International Conference, AFL 2011, Debrecen, Hungary, August 17-22, 2011, Proceedings
Pál Dömösi
,
Szabolcs Iván
, editors,
2011.
Symmetries of Automata
Attila Egri-Nagy
,
Chrystopher L. Nehaniv
.
afl 2011
:
391
Algorithms for the Efficient Calculation of the Holonomy Decomposition
Attila Egri-Nagy
,
James D. Mitchell
,
Chrystopher L. Nehaniv
.
afl 2011
:
389-390
Grammar Systems as Orchestras of Grammatical Services
Gemma Bel Enguix
,
María Adela Grando
,
Maria Dolores Jiménez-López
.
afl 2011
:
65-78
Palindromes and Primitivity
Szilárd Zsolt Fazekas
,
Peter Leupold
,
Kayoko Shikishima-Tsuji
.
afl 2011
:
184-196
The Chop of Languages
Markus Holzer
,
Sebastian Jakobi
,
Martin Kutrib
.
afl 2011
:
197-210
Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic Machines
Oscar H. Ibarra
,
Shinnosuke Seki
.
afl 2011
:
211-224
K-Restricted Duplication Closure of Languages
Masami Ito
.
afl 2011
:
28-33
Müller context-free grammars generating well-ordered words
Szabolcs Iván
,
Ágnes Mészáros
.
afl 2011
:
225-240
De Bruijn Sequences Revisited
Lila Kari
,
Zhi Xu
.
afl 2011
:
241-254
Around Dot-Depth One
Manfred Kufleitner
,
Alexander Lauser
.
afl 2011
:
255-269
Algebraic Properties of Petri Net Morphisms based on Place Connectivity
Yoshiyuki Kunimochi
.
afl 2011
:
270-284
Affordance Graphs for User Interface Design: Application of Category-theoretic Constructs
Esther-Anna Loeliger
,
Chrystopher L. Nehaniv
.
afl 2011
:
392-394
Notes on Hyper-minimization
Andreas Maletti
.
afl 2011
:
34-49
Hyper-minimisation of deterministic weighted finite automata over semifields
Andreas Maletti
,
Daniel Quernheim
.
afl 2011
:
285-299
Accepting Networks of Evolutionary Processors with Subregular Filters
Florin Manea
,
Bianca Truthe
.
afl 2011
:
300-314
On Nondeterminism in Programmed Grammars
Alexander Meduna
,
Lukás Vrábel
,
Petr Zemek
.
afl 2011
:
315-327
Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata
Benedek Nagy
,
Friedrich Otto
.
afl 2011
:
328-342
Tree Homomorphisms for Unranked Trees
Xiaoxue Piao
,
Kai Salomaa
,
Sándor Vágvölgyi
.
afl 2011
:
343-357
Equational descriptions of languages
Jean-Éric Pin
.
afl 2011
:
50-63
Towards Shortest Synchronizing Words in Polynomial Time
Vedala T. K. Pramod
,
Kanduru V. Krishna
.
afl 2011
:
358-367
Recent Developments in Firing Squad Synchronization Algorithms for Two-Dimensional Cellular Automata and Their State-Efficient Implementations
Hiroshi Umeo
.
afl 2011
:
368-387
2008
Semigroups of regular languages over a one letter alphabet are rational
Sergey Afonin
,
Elena Khazova
.
afl 2008
:
61-73
Continuous Languages
Thomas Ang
,
Janusz A. Brzozowski
.
afl 2008
:
74-85
Simulation equivalence of automata and circuits
Miklós Bartha
.
afl 2008
:
86-99
Counting of a family of column-convex rectilinear tiles
Christiane Bercoff
.
afl 2008
:
100-110
Computing Weak Periods of Partial Words
Francine Blanchet-Sadri
,
Taktin Oey
,
Timothy D. Rankin
.
afl 2008
:
134-145
Counting Distinct Squares in Partial Words
Francine Blanchet-Sadri
,
Robert Mercas
,
Geoffrey Scott
.
afl 2008
:
122-133
NP-completeness of the alphabetical satisfiability problem for trace equations
Luca Breveglieri
,
Alessandra Cherubini
,
Claudia Di Nucci
,
Emanuele Rodaro
.
afl 2008
:
111-121
Non-Linear Subband Coding with Cellular Automata
Carlos Cruz-Reyes
,
Jarkko Kari
.
afl 2008
:
146-157
Automata and Formal Languages, 12th International Conference, AFL 2008, Balatonfüred, Hungary, May 27-30, 2008, Proceedings
Erzsébet Csuhaj-Varjú
,
Zoltán Ésik
, editors,
2008.
Subregularly Tree Controlled Grammars and Languages
Jürgen Dassow
,
Bianca Truthe
.
afl 2008
:
158-169
A Kleene Theorem for Binoid Languages
Zsolt Gazdag
,
Zoltán L. Németh
.
afl 2008
:
170-182
Hyper-Minimizing Minimized Deterministic Automata
Viliam Geffert
,
Andrew Badr
,
Ian Shipman
.
afl 2008
:
9-30
Homomorphisms Preserving Types of Density
Helmut Jürgensen
,
Ian McQuillan
.
afl 2008
:
183-194
Extending finite-memory automata with non-deterministic reassignment (Extended abstract)
Michael Kaminski
,
Daniel Zeitlin
.
afl 2008
:
195-207
Monocultures in eco-grammar systems
Alica Kelemenová
,
Tomás Bartík
.
afl 2008
:
208-219
Literally idempotent languages and their varieties - two letter case
Ondrej Klíma
,
Libor Polák
.
afl 2008
:
220-231
Automata associated with open conjugated systems
Miklós Krész
.
afl 2008
:
232-244
Euler paths and ends in automatic and recursive graphs
Dietrich Kuske
,
Markus Lohrey
.
afl 2008
:
245-256
On Stateless Two-Pushdown Automata and Restarting Automata
Martin Kutrib
,
Hartmut Messerschmidt
,
Friedrich Otto
.
afl 2008
:
257-268
Boolean grammars and gsm mappings
Tommi Lehtinen
,
Alexander Okhotin
.
afl 2008
:
269-280
How to Pop a Deep PDA Matters
Peter Leupold
.
afl 2008
:
281-291
Compressed membership problems revisited
Markus Lohrey
.
afl 2008
:
31-53
Sublinearly Space Bounded Iterative Arrays
Andreas Malcher
,
Carlo Mereghetti
,
Beatrice Palano
.
afl 2008
:
292-301
Some Remarks on the Hairpin Completion
Florin Manea
,
Victor Mitrana
,
Takashi Yokomori
.
afl 2008
:
302-313
Complexity of problems concerning reset words for commutative automata and automata with simple idempotents
Pavel V. Martyugin
.
afl 2008
:
314-324
On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops
Tomás Masopust
,
Alexander Meduna
.
afl 2008
:
325-336
Kleene revisited by Suschkewitsch
Jean Marcel Pallo
.
afl 2008
:
337-348
Membrane Computing: Recent Developments and Applications (Extended Abstract)
Gheorghe Paun
.
afl 2008
:
350-351
Mathematics of gene assembly in ciliates (Abstract)
Ion Petre
.
afl 2008
:
54-55
Cellular Wave Computers - Algorithms for million processor computers (Abstract)
Tamás Roska
.
afl 2008
:
352
The sequentialisation of automata and transducers (Abstract)
Jacques Sakarovitch
.
afl 2008
:
56-57
In silico Evolutionary Developmental Neurobiology and the Origin of Natural Language (Abstract)
Eörs Szathmáry
.
afl 2008
:
353
Sign in
or
sign up
to see more results.