


default search action
Journal of Automata, Languages and Combinatorics, Volume 15
Volume 15, Number 1/2, 2010
- Jürgen Dassow, Giovanni Pighizzini, Bianca Truthe

:
Editorial. 5 - Marco Almeida, Nelma Moreira, Rogério Reis:

Testing the Equivalence of Regular Languages. 7-25 - Pierre-Yves Angrand, Sylvain Lombardy, Jacques Sakarovitch:

On the Number of Broken Derived Terms of a Rational Expression. 27-51 - Franziska Biegler, Mark Daley, Ian McQuillan

:
On the Shuffle Automaton Size for Words. 53-70 - Janusz A. Brzozowski:

Quotient Complexity of Regular Languages. 71-89 - Erzsébet Csuhaj-Varjú, György Vaszil:

On the Descriptional Complexity of Context-Free Non-returning PC Grammar Systems. 91-105 - Hermann Gruber

, Markus Holzer, Martin Kutrib
:
On Measuring Non-recursive Trade-Offs. 107-120 - Galina Jirásková, Alexander Okhotin:

Nondeterministic State Complexity of Positional Addition. 121-133 - Martin Kutrib

, Andreas Malcher:
One-Way Cellular Automata, Bounded Languages, and Minimal Communication. 135-153 - Remco Loos, Florin Manea, Victor Mitrana:

Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections. 155-174 - Ralf Stiebe, Sherzod Turaev:

Capacity-Bounded Grammars. 175-194
Volume 15, Number 3/4, 2010
- Francine Blanchet-Sadri, Mihai Cucuringu:

Counting Primitive Partial Words. 199-227 - Matthias Büchse, Jonathan May, Heiko Vogler:

Determinization of Weighted Tree Automata Using Factorizations. 229-254 - Juha Honkala:

Ultimately Periodic Languages. 255-261 - Sándor Horváth, Manfred Kudlek:

A Complete Density Range of Continuum-Many Non-Context-Free Languages Fulfilling Strong Iteration Properties. 263-268 - Stavros Konstantinidis

, Joshua Young:
f-Words and Binary Solid Codes. 269-283 - Emil Daniel Schwab:

On Fibonacci and Thue-Morse Words. 285-295

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














