


Остановите войну!
for scientists:


default search action
Journal of Automata, Languages and Combinatorics, Volume 17
Volume 17, Number 1, 2012
- Ulrike Brandt, Hermann K.-G. Walter:
On Testing Output Faults in the McCluskey Fault Model. 3-16 - Ronny Harbich, Bianca Truthe
:
A Comparison of the Descriptional Complexity of Classes of Limited Lindenmayer Systems. 17-56
Volume 17, Numbers 2-4, 2012
- Jürgen Dassow, Martin Kutrib, Nelma Moreira, Rogério Reis:
Editorial. 59-60 - Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini:
On Inverse Operations and Their Descriptional Complexity. 61-81 - Janusz A. Brzozowski, Baiyu Li, David Liu:
Syntactic Complexities of Six Classes of Star-Free Languages. 83-105 - Cezar Câmpeanu:
Randomness in Blum Universal Static Complexity Spaces. 107-122 - Jürgen Dassow, Ronny Harbich:
Descriptional Complexity of Union and Star on Context-Free Languages. 123-143 - Jürgen Dassow, Florin Manea, Bianca Truthe
:
On Subregular Selection Languages in Internal Contextual Grammars. 145-164 - Markus Holzer, Sebastian Jakobi:
Descriptional Complexity of Chop Operations on Unary and Finite Languages. 165-183 - Jean-Baptiste Jeannin, Dexter Kozen:
Computing with Capsules. 185-204 - Christos A. Kapoutsis:
Minicomplexity. 205-224 - Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Pushdown Store Languages. 225-244 - Alexandros Palioudakis, Kai Salomaa, Selim G. Akl:
State Complexity of Finite Tree Width NFAs. 245-264 - André Platzer:
Logical Analysis of Hybrid Systems: A Answer to a Complexity Challenge. 265-275 - Pedro V. Silva:
Groups and Automata: a Perfect Match. 277-292 - Klaus Sutner, Kevin Lewi:
Iterating Inverse Binary Transducers. 293-313

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.