Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Automata, Languages and Combinatorics, Volume 6
Volume 6, Number 1, 2001
- Catalin Dima:
Real-Time Automata. 3-23 - Helmut Jürgensen, Masashi Katsura, Stavros Konstantinidis:
Maximal Solid Codes. 25-50 - Markus E. Nebel:
On the Power of Subroutines for Finite State Machines. 51-74 - Gheorghe Paun:
P Systems with Active Membranes: Attacking NP-Complete Problems. 75-90 - Paavo Turakainen:
Injectivity of the Quotient h\g of two Morphisms and Ambiguity of Linear Grammars. 91-96 - Dietmar Wätjen, David Ostrovsky:
Function-Limited 0L Systems Revisited. 97-114
Volume 6, Number 2, 2001
- Valérie Berthé, Laurent Vuillon:
Palindromes and Two-Dimensional Sturmian Sequences. 121-138 - Douglas S. Bridges, Ayan Mahalanobis:
Increasing, Nondecreasing, and Virtually Continuous Functions. 139-143 - Zoltán Fülöp:
Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers. 145-189 - Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard:
Distributed Pattern Matching Using Finite Automata. 191-201 - Tatjana Petkovic, Magnus Steinby:
Piecewise Directable Automata. 205-220 - Sheng Yu:
State Complexity of Regular Languages. 221-234
Volume 6, Number 3, 2001
- Mouhamed Kadrie Ahmad, Xavier Augros:
Some Results on Codes for Generalized Factorizations. 239-251 - Klaus Denecke, Jörg Koppitz, Slavcho Shtrakov:
The Depth of a Hypersubstitution. 253-262 - Yannick Guesnet:
On Maximal Dense Bifix Codes. 263-273 - Pierre-Cyrille Héam:
Some Topological Properties of Rational Sets. 275-290 - Costas S. Iliopoulos, Jamie Simpson:
On-Line Validation and Analysis of Partially Occluded Images. 291-303 - Andrei V. Kelarev, Olga Sokratova:
Directed Graphs and Syntactic Algebras of Tree Languages. 305-311 - Rainer Kemp:
On the Expected Number of Leftist Nodes in Simply Generated Trees. 313-343 - Shankara Narayanan Krishna, Raghavan Rama:
P Systems with Replicated Rewriting. 345-350 - Erkki Mäkinen:
On the Inclusion Problem for Very Simple Deterministic Pushdown Automata. 351-357 - Vincenzo Manca, Carlos Martín-Vide, Gheorghe Paun:
On the Power of P Systems with Replicated Rewriting. 359-374 - Friedrich Otto, Nikola Ruskuc:
Confluent Monadic String-Rewriting Systems and Automatic Structures. 375-388
Volume 6, Number 4, 2001
- Helmut Jürgensen:
Editorial. 393 - Suna Aydin, Helmut Jürgensen, Lynda E. Robbins:
Dialogues as Co-Operating Grammars. 395-410 - Henning Bordihn, Markus Holzer:
On the Number of Active Symbols in L and CD Grammar Systems. 411-426 - Pál Dömösi, Zoltán Ésik:
Homomorphic Simulation and Letichevsky's Criterion. 427-436 - Christian Glaßer, Heinz Schmitz:
The Boolean Structure of Dot-Depth One. 437-452 - Markus Holzer, Kai Salomaa, Sheng Yu:
On the State Complexity of k-Entry Deterministic Finite Automata. 453-466 - Bakhadyr Khoussainov, Sasha Rubin:
Graphs with Automatic Presentations over a Unary Alphabet. 467-480 - Massimiliano Milani, Giovanni Pighizzini:
Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata. 481-492 - Frantisek Mráz:
Lookahead Hierarchies of Restarting Automata. 493-506 - Taishin Y. Nishida:
Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems. 507-518 - Alexander Okhotin:
Conjunctive Grammars. 519-535 - Jeffrey O. Shallit, Ming-wei Wang:
Automatic Complexity of Strings. 537-554 - K. G. Subramanian, D. Gnanaraj Thomas, P. Helen Chandra, Maia Hoeberechts:
Basic Puzzle Grammars and Generation of Polygons. 555-568 - Yuri Velinov:
On the Regions of Influence in Complex Decomposition Forms of Finite Functions. 569-579
a service of 
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-05-10 18:47 CEST 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:
