Journal: Journal of Automata, Languages and Combinatorics

Volume 6, Issue 4

393 -- 0Helmut Jürgensen. Editorial
395 -- 410Suna Aydin, Helmut Jürgensen, Lynda E. Robbins. Dialogues as Co-Operating Grammars
411 -- 426Henning Bordihn, Markus Holzer. On the Number of Active Symbols in L and CD Grammar Systems
427 -- 436Pál Dömösi, Zoltán Ésik. Homomorphic Simulation and Letichevsky s Criterion
437 -- 452Christian Glaßer, Heinz Schmitz. The Boolean Structure of Dot-Depth One
453 -- 466Markus Holzer, Kai Salomaa, Sheng Yu. On the State Complexity of k-Entry Deterministic Finite Automata
467 -- 480Bakhadyr Khoussainov, Sasha Rubin. Graphs with Automatic Presentations over a Unary Alphabet
481 -- 492Massimiliano Milani, Giovanni Pighizzini. Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata
493 -- 506Frantisek Mráz. Lookahead Hierarchies of Restarting Automata
507 -- 518Taishin Y. Nishida. Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems
519 -- 535Alexander Okhotin. Conjunctive Grammars
537 -- 554Jeffrey Shallit, Ming-wei Wang. Automatic Complexity of Strings
555 -- 568K. G. Subramanian, D. G. Thomas, P. Helen Chandra, Maia Hoeberechts. Basic Puzzle Grammars and Generation of Polygons
569 -- 579Yuri Velinov. On the Regions of Influence in Complex Decomposition Forms of Finite Functions

Volume 6, Issue 3

239 -- 251Mouhamed Kadrie Ahmad, Xavier Augros. Some Results on Codes for Generalized Factorizations
253 -- 262Klaus Denecke, Jörg Koppitz, Slavcho Shtrakov. The Depth of a Hypersubstitution
263 -- 273Yannick Guesnet. On Maximal Dense Bifix Codes
275 -- 290Pierre-Cyrille Héam. Some Topological Properties of Rational Sets
291 -- 303Costas S. Iliopoulos, Jamie Simpson. On-Line Validation and Analysis of Partially Occluded Images
305 -- 311Andrei Kelarev, Olga Sokratova. Directed Graphs and Syntactic Algebras of Tree Languages
313 -- 343Rainer Kemp. On the Expected Number of Leftist Nodes in Simply Generated Trees
345 -- 350Shankara Narayanan Krishna, Raghavan Rama. P Systems with Replicated Rewriting
351 -- 357Erkki Mäkinen. On the Inclusion Problem for Very Simple Deterministic Pushdown Automata
359 -- 374Vincenzo Manca, Carlos Martín-Vide, Gheorghe Paun. On the Power of P Systems with Replicated Rewriting
375 -- 388Friedrich Otto, Nikola Ruskuc. Confluent Monadic String-Rewriting Systems and Automatic Structures

Volume 6, Issue 2

121 -- 138Valérie Berthé, Laurent Vuillon. Palindromes and Two-Dimensional Sturmian Sequences
139 -- 144Douglas S. Bridges, Ayan Mahalanobis. Increasing, Nondecreasing, and Virtually Continuous Functions
145 -- 190Zoltán Fülöp. Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers
191 -- 204Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard. Distributed Pattern Matching Using Finite Automata
205 -- 220Tatjana Petkovic, Magnus Steinby. Piecewise Directable Automata
221 -- 0Sheng Yu. State Complexity of Regular Languages

Volume 6, Issue 1

3 -- 24Catalin Dima. Real-Time Automata
25 -- 50Helmut Jürgensen, Masashi Katsura, Stavros Konstantinidis. Maximal Solid Codes
51 -- 74Markus E. Nebel. On the Power of Subroutines for Finite State Machines
75 -- 90Gheorghe Paun. P Systems with Active Membranes: Attacking NP-Complete Problems
91 -- 96Paavo Turakainen. Injectivity of the Quotient h/g of two Morphisms and Ambiguity of Linear Grammars
97 -- 0Dietmar Wätjen, David Ostrovsky. Function-Limited 0L Systems Revisited