default search action
Journal of Automata, Languages and Combinatorics, Volume 25
Volume 25, Number 1, 2020
- Jürgen Dassow:
Lindenmayer Systems with Control by Ideals and Codes. 3-20 - Sigrid Ewert, Daria Sergeevna Tkachova:
Necessary Conditions for Subclasses of Random Context Galleries. 21-35 - Radim Kocman, Zbynek Krivka, Alexander Meduna:
General CD Grammar Systems and Their Simplification. 37-54 - Stavros Konstantinidis:
Every Regular Bifix Code is a Finite Union of Regular Infix Codes. 55-59 - Toufik Mansour, Matthias Schork, Armend Shaban Shabani:
Restricted Lego Towers. 61-76
Volume 25, Numbers 2-3, 2020
- Michal Hospodár, Galina Jirásková, Giovanni Pighizzini:
Preface. 81-82 - Jürgen Dassow, Bianca Truthe:
Generating Networks of Evolutionary Processors with Resources Restricted and Structure Limited Filters. 83-113 - Markus Holzer, Martin Kutrib:
Automata That May Change Their Mind. 115-140 - Ondrej Klíma, Libor Polák:
Forbidden Patterns for Ordered Automata. 141-169 - Martin Kutrib, Friedrich Otto:
On Two-Sided Locally Testable Languages. 171-199 - Martin Plátek, Friedrich Otto, Frantisek Mráz:
On h-Lexicalized Restarting List Automata. 201-234 - Tomoyuki Yamakami:
One-Way Topological Automata and the Tantalizing Effects of Their Topological Features. 235-273
Volume 25, Number 4, 2020
- Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher, Toufik Mansour, Mark Shattuck:
Counting Permutations by the Number of Vertical Edges in Their Bargraphs. 279-290 - Pascal Caron, Jean-Gabriel Luque, Bruno Patrou:
A Combinatorial Approach for the State Complexity of the Shuffle Product. 291-320 - Kalpana Mahalingam, Prithwineel Paul:
On Szilard Languages of InsDel Systems. 321-348 - Niklas Zechner:
Derivatives of Regular Expressions with Cuts. 349-355
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.