default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Automata, Languages and Combinatorics, Volume 7
Volume 7, Number 1, 2002
- Sergey V. Avgustinovich, Anna E. Frid:
Words Avoiding Abelian Inclusions. 3-9 - Joost Engelfriet, Zoltán Fülöp, Heiko Vogler:
Bottom-Up and Top-Down Tree Series Transformations. 11-70 - Ferenc Gécseg, Balázs Imreh:
On Monotone Automata and Monotone Languages. 71-82 - Lucien Haddad, Hajime Machida, Ivo G. Rosenberg:
Maximal and Minimal Partial Clones. 83-93 - Carlo Mereghetti, Beatrice Palano:
The Parallel Complexity of Deterministic and Probabilistic Automata. 95-108 - Albert R. Meyer, Alexander Rabinovich:
Valid Identity Problem for Shuffle Regular Expressions. 109-125 - Eileen Peluso, Jonathan Goldstine, Shashi Phoha:
Normal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event Systems. 127-142 - Huei-Jan Shyr:
Regular Nests. 143-157
Volume 7, Number 2, 2002
- Manfred Droste, Paul Gastin:
Editorial. 165 - Patricia Bouyer, Antoine Petit:
A Kleene/Büchi-like Theorem for Clock Languages. 167-186 - Dietrich Kuske, Rémi Morin:
Pomsets for Local Trace Languages. 187-224 - Doron A. Peled, Moshe Y. Vardi, Mihalis Yannakakis:
Black Box Checking. 225-246 - Pascal Tesson, Denis Thérien:
The Computing Power of Programs over Finite Monoids. 247-258 - Igor Walukiewicz:
Local Logics for Traces. 259-290
Volume 7, Number 3, 2002
- Talal Ali Al-Hawary:
Characterizations of Certain Matroids via Flats. 295-301 - Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. 303-310 - Christian Germain, Jean Marcel Pallo:
Linear Languages with a Nonassociative Concatenation. 311-320 - Mehryar Mohri:
Semiring Frameworks and Algorithms for Shortest-Distance Problems. 321-350 - Michel Rigo, Arnaud Maes:
More on Generalized Automatic Sequences. 351-376 - Daniel-Claudian Voinescu:
On the Combinatorial Alphabets of a Language. 377-394 - Lan Zhang, Katsushi Inoue, Akira Ito, Yue Wang:
A Leaf-Size Hierarchy of Alternating Rebound Turing Machines. 395-410
Volume 7, Number 4, 2002
- Jürgen Dassow, Detlef Wotschke, Bernd Reichel:
Editorial. 417 - Henry N. Adorna:
3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata. 419-432 - K. Arthi, Kamala Krithivasan, Erzsébet Csuhaj-Varjú:
On Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems. 433-446 - Henning Bordihn, Bernd Reichel:
On Descriptions of Context-Free Languages by CD Grammar Systems. 447-454 - Michael Domaratzki:
State Complexity of Proportional Removals. 455-468 - Michael Domaratzki, Derek Kisman, Jeffrey O. Shallit:
On the Number of Distinct Languages Accepted by Finite Automata with n States. 469-486 - Henning Fernau, Markus Holzer:
Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. 487-503 - Kosaburo Hashiguchi, Takahiro Kunai, Shuji Jimbo:
Finite Codes over Free Binoids. 505-518 - Juraj Hromkovic:
Descriptional Complexity of Finite Automata: Concepts and Open Problems. 519-531 - Martin Kutrib
:
Refining Nondeterminism Below Linear Time. 533-547 - Andreas Malcher:
Descriptional Complexity of Cellular Automata and Decidability Questions. 549-560 - Carlos Martín-Vide, Victor Mitrana:
Grammars with Bounded-Life Resources. 561-570 - Alexander Meduna:
Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview. 571-577 - Patrice Séébold:
About some Overlap-Free Morphisms on a n-Letter Alphabet. 579-597 - Ferucio Laurentiu Tiplea, Erkki Mäkinen:
On the Complexity of a Problem on Monadic String Rewriting Systems. 599-609
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.
last updated on 2024-11-21 20:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
