Journal of Automata, Languages and Combinatorics formerly: Journal of Information Processing and Cybernetics / Elektronische Informationsverarbeitung und Kybernetik

1 (1996) 1 P. J. GRABNER, H. PRODINGER:             On the Optimality of an Algorithm of Reingold and Supowit.             Journal of Automata, Languages and Combinatorics 1 (1996) 1, 5–11. L. KARI, G. THIERRIN:             Omega-Syntactic Congruences.             Journal of Automata, Languages and Combinatorics 1 (1996) 1, 13–26. G. PĂUN:             Regular Extended H Systems are Computationally Universal.             Journal of Automata, Languages and Combinatorics 1 (1996) 1, 27–36. K. SALOMAA:             On the Modularity of Decidability of Completeness and Termination.             Journal of Automata, Languages and Combinatorics 1 (1996) 1, 37–53. D. WÄTJEN:             Regulations of Uniformly k-Limited ET0L Systems and Their Relations to Controlled Context-Free Grammars.             Journal of Automata, Languages and Combinatorics 1 (1996) 1, 55–74. 1 (1996) 2 I. BANÍK:             Colonies as Systems of Turing Machines Without States.             Journal of Automata, Languages and Combinatorics 1 (1996) 2, 81–96. H. BORDIHN, H. FERNAU:             Accepting Grammars and Systems via Context Condition Grammars.             Journal of Automata, Languages and Combinatorics 1 (1996) 2, 97–112. J. D. CURRIE, R. O. SHELTON:             Cantor Sets and Dejean's Conjecture.             Journal of Automata, Languages and Combinatorics 1 (1996) 2, 113–127. J. JEDRZEJOWICZ:             Undecidability Results for Shuffle Languages.             Journal of Automata, Languages and Combinatorics 1 (1996) 2, 147–159. P. HARTMANN:             Implementation of Parallel Replacement Systems for Cellular Hypergraphs.             Journal of Automata, Languages and Combinatorics 1 (1996) 2, 129–146. 1 (1996) 3 S. BOZAPALIDIS:             Convex Algebras, Convex Modules and Formal Power Series on Trees.             Journal of Automata, Languages and Combinatorics 1 (1996) 3, 165–180. G. GEORGESCU:             On the Regularity of Languages Generated by Parallel Communicating Grammar Systems.             Journal of Automata, Languages and Combinatorics 1 (1996) 3, 181–197. J. S. GOLAN, A. MATEESCU, D. VAIDA:             Semirings and Parallel Composition of Processes.             Journal of Automata, Languages and Combinatorics 1 (1996) 3, 199–217. G. PĂUN, G. ROZENBERG, A. SALOMAA:             Pattern Grammars.             Journal of Automata, Languages and Combinatorics 1 (1996) 3, 219–235. 1 (1996) 4 H. FERNAU:             Membership for k-Limited ET0L Languages is Not Decidable.             Journal of Automata, Languages and Combinatorics 1 (1996) 4, 243–245. S. GHILEZAN:             Generalized Finiteness of Developments in Typed Lambda Calculi.             Journal of Automata, Languages and Combinatorics 1 (1996) 4, 247–257. R. KEMP:             On Prefixes of Formal Languages and Their Relation to the Average-Case Complexity of the Membership Problem.             Journal of Automata, Languages and Combinatorics 1 (1996) 4, 259–303. V. MITRANA:             Iterated Pattern Languages.             Journal of Automata, Languages and Combinatorics 1 (1996) 4, 305–311. 2 (1997) 1 K. CULIK II, V. VALENTA:             Generalized Finite Automata and Transducers.             Journal of Automata, Languages and Combinatorics 2 (1997) 1, 3–17. U. HUCKENBECK:             On Valve Adjustments that Interrupt all s-t-Paths in a Digraph.             Journal of Automata, Languages and Combinatorics 2 (1997) 1, 19–45. F. L. TIPLEA, M. KATSURA, M. ITO:             Processes and Vectorial Characterizations of Parallel Communicating Grammar Systems.             Journal of Automata, Languages and Combinatorics 2 (1997) 1, 47–73. 2 (1997) 2 H. FERNAU:             Graph-Controlled Grammars as Language Acceptors.             Journal of Automata, Languages and Combinatorics 2 (1997) 2, 79–91. J. GRUSKA, I. GUESSARIAN:             Fixpoint Semantics of Synchronized Systems and Correctness of Their Basic Transformations.             Journal of Automata, Languages and Combinatorics 2 (1997) 2, 93–133. M. KRIESELL:             A Note on Hamiltonian Cycles in Lexicographical Products.             Journal of Automata, Languages and Combinatorics 2 (1997) 2, 135–138. 2 (1997) 3 J. DUSKE, R. PARCHMANN:             Non-Synchronized Pattern Languages are IO-Macro Languages.             Journal of Automata, Languages and Combinatorics 2 (1997) 3, 143–149. V. MITRANA:             Crossover Systems. A Generalization of Splicing Systems.             Journal of Automata, Languages and Combinatorics 2 (1997) 3, 151–160. M. E. NEBEL:             New Results on the Stack Ramification of Binary Trees.             Journal of Automata, Languages and Combinatorics 2 (1997) 3, 161–175. K. SALOMAA, S. YU:             NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets.             Journal of Automata, Languages and Combinatorics 2 (1997) 3, 177–186. F. L. TIPLEA, C. ENE:             Hierarchies of Petri Net Languages and a Super-Normal Form.             Journal of Automata, Languages and Combinatorics 2 (1997) 3, 187–204. 2 (1997) 4 W. GÖHRING:             Minimal Initializing Word: A Contribution to Cerny's Conjecture.             Journal of Automata, Languages and Combinatorics 2 (1997) 4, 209–226. J. LIEBEHENSCHEL:             Ranking and Unranking of Lexicographically Ordered Words: an Average-Case Analysis.             Journal of Automata, Languages and Combinatorics 2 (1997) 4, 227–268. L. DE PROPHETIS, S. VARRICCHIO:             Recognizability of Rectangular Pictures by Wang Systems.             Journal of Automata, Languages and Combinatorics 2 (1997) 4, 269–288. 3 (1998) 1 P. BOTTONI, A. LABELLA, P. MUSSIO, G. PĂUN:             Pattern Control on Derivations in Context-Free Rewriting.             Journal of Automata, Languages and Combinatorics 3 (1998) 1, 3–28. A. E. FRID:             On the Frequency of Factors in a D0L Word.             Journal of Automata, Languages and Combinatorics 3 (1998) 1, 29–41. J. KORTELAINEN:             On the System of Word Equations x0u1ix1u2ix2… umixm = y0v1iy1v2iy2… vniyn (i = 0,1,2,…) in a Free Monoid.             Journal of Automata, Languages and Combinatorics 3 (1998) 1, 43–57. V. RADHAKRISHNAN, V. T, CHAKARAVARTHY, K. KRITHIVASAN:             Pattern Matching in Matrix Grammars.             Journal of Automata, Languages and Combinatorics 3 (1998) 1, 59–72. 3 (1998) 2 F. GÉCSEG, B. IMREH, A. PLUHÁR:             On the Existence of Finite Isomorphically Complete Systems of Automata.             Journal of Automata, Languages and Combinatorics 3 (1998) 2, 77–84. M. KAPPES:             Multi-Bracketed Contextual Grammars.             Journal of Automata, Languages and Combinatorics 3 (1998) 2, 85–103. S. MANETH, H. VOGLER:             Attributed Context-Free Hypergraph Grammars.             Journal of Automata, Languages and Combinatorics 3 (1998) 2, 105–147. 4 (1999) 1 C. MARTIN-VIDE, G. PĂUN:             Cooperating Distributed Splicing Systems.             Journal of Automata, Languages and Combinatorics 4 (1999) 1, 3–16. I. PETRE:             Parikh's Theorem Does Not Hold for Multiplicities.             Journal of Automata, Languages and Combinatorics 4 (1999) 1, 17–30. D. WÄTJEN:             Teams of Limited and Uniformly Limited 0L Systems.             Journal of Automata, Languages and Combinatorics 4 (1999) 1, 31–57. L. ZHANG, K.-P. SHUM, S.-L. PENG:             Generalized Prefix Relations and Codes with Finite Decoding Delay.             Journal of Automata, Languages and Combinatorics 4 (1999) 1, 59–71. 4 (1999) 2 E. BERTSCH:             Abstract Comparison of two Error Detection Techniques for Programming Languages.             Journal of Automata, Languages and Combinatorics 4 (1999) 2, 77–86. V. BRUYÈRE, C. DE FELICE:             On the Existence of Codings Between Trace Monoids.             Journal of Automata, Languages and Combinatorics 4 (1999) 2, 87–100. J. CURRIE, H. PETERSEN, J. M. ROBSON, J. SHALLIT:             Separating Words with Small Grammars.             Journal of Automata, Languages and Combinatorics 4 (1999) 2, 101–110. C. DE FELICE:             Hajós Factorizations of Cyclic Groups – A Simpler Proof of a Characterization.             Journal of Automata, Languages and Combinatorics 4 (1999) 2, 111–116. H. FERNAU, F. STEPHAN:             Characterizations of Recursively Enumerable Languages by Programmed Grammars with Unconditional Transfer.             Journal of Automata, Languages and Combinatorics 4 (1999) 2, 117–142. 4 (1999) 3 J. CASSAIGNE:             Double Sequences with Complexity mn+1.             Journal of Automata, Languages and Combinatorics 4 (1999) 3, 153–170. C. CHOFFRUT, H. PELIBOSSIAN, P. SIMONNET:             Decision Issues on Functions Realized by Finite Automata.             Journal of Automata, Languages and Combinatorics 4 (1999) 3, 171–181. J. DEVOLDER:             Generators with Bounded Deciphering Delay for Rational ω-Languages.             Journal of Automata, Languages and Combinatorics 4 (1999) 3, 183–204. J.-P. DUVAL, L. MOUCHARD:             Sequences Obtained from a Series of Permutations of Borders and Ultimately Periodic Words.             Journal of Automata, Languages and Combinatorics 4 (1999) 3, 205–211. C. S. ILIOPOULOS, L. MOUCHARD:             Quasiperiodicity: From Detection to Normal Forms.             Journal of Automata, Languages and Combinatorics 4 (1999) 3, 213–228. A. MAES:             An Automata Theoretic Decidability Proof for First-Order Theory of langle nat ,<,P rangle with Morphic Predicate P.             Journal of Automata, Languages and Combinatorics 4 (1999) 3, 229–245. J.-F. RASKIN, P.-Y. SCHOBBENS:             The Logic of Event Clocks – Decidability, Complexity and Expressiveness.             Journal of Automata, Languages and Combinatorics 4 (1999) 3, 247–282. 4 (1999) 4 P. JANCAR, F. MRÁZ, M. PLÁTEK, J. VOGEL:             On Monotonic Automata with a Restart Operation.             Journal of Automata, Languages and Combinatorics 4 (1999) 4, 287–311. R. KEMP:             On Leftist Simply Generated Trees.             Journal of Automata, Languages and Combinatorics 4 (1999) 4, 313–331. M. MADONIA, S. SALEMI, T. SPORTELLI:             Covering Submonoids and Covering Codes.             Journal of Automata, Languages and Combinatorics 4 (1999) 4, 333–350. H.-J. SHYR, S.-S. YU:             Some Properties of Left Non-Cancellative Languages.             Journal of Automata, Languages and Combinatorics 4 (1999) 4, 351–360. 5 (2000) 1 Special Issue: Selected Papers of the MFCS '98 Satellite Workshop on Grammar Systems (Brno, Czech Republic, August 22–23, 1998) J. KELEMEN, A. KELEMENOVÁ:             Grammar Systems: Where are we? And Where do we go from Here? (As an Editorial).             Journal of Automata, Languages and Combinatorics 5 (2000) 1, 5–12. R. FREUND:             Array Grammar Systems.             Journal of Automata, Languages and Combinatorics 5 (2000) 1, 13–29. J. GASO:             Unreliable Colonies – the Sequential Case.             Journal of Automata, Languages and Combinatorics 5 (2000) 1, 31–44. P. SOSÍK:             On the Decidability Problems of Eco-Grammar Systems.             Journal of Automata, Languages and Combinatorics 5 (2000) 1, 45–58. G. VASZIL:             Further Remarks on Parallel Communicating Grammar Systems without a Master.             Journal of Automata, Languages and Combinatorics 5 (2000) 1, 59–75. 5 (2000) 2 R. DEVILLERS, H. KLAUDEL, E. PELZ:             An Algebraic Box Calculus.             Journal of Automata, Languages and Combinatorics 5 (2000) 2, 81–107. Z. ÉSIK, W. KUICH:             A Kleene Theorem for Lindenmayerian Algebraic Power Series.             Journal of Automata, Languages and Combinatorics 5 (2000) 2, 109–122. J. HONKALA:             On Formal Power Series Generated by Lindenmayer Systems.             Journal of Automata, Languages and Combinatorics 5 (2000) 2, 123–144. A. MATEESCU, K. SALOMAA, S. YU:             On Fairness of Many-Dimensional Trajectories.             Journal of Automata, Languages and Combinatorics 5 (2000) 2, 145–157. D. WÄTJEN:             Undecidability Results for Uniformly k-Limited 0L Systems.             Journal of Automata, Languages and Combinatorics 5 (2000) 2, 159–167. 5 (2000) 3 Special Issue: Selected Papers of the First International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (Magdeburg, Germany, July 20–23, 1999) E. CSUHAJ-VARJÚ:             Parallel Communicating Grammar Systems with Bounded Resources: Results, Techniques, Open Problems.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 175–190. J. GRUSKA:             Descriptional Complexity Issues in Quantum Computing.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 191–218. K. HASHIGUCHI, S. ICHIHARA, S. JIMBO:             Formal Languages over Free Bionoids.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 219–234. H. LEUNG:             On a Family of Nondeterministic Finite Automata.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 235–244. H. PETERSEN:             Prefix Rewriting and Descriptional Complexity.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 245–254. J. SHALLIT:             Automaticity and Rationality.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 255–268. M. KAPPES:             Descriptional Complexity of Deterministic Finite Automata with Multiple Initial States.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 269–278. C. MARTÍN-VIDE, A. MATEESCU:             Special Families of Sewing Languages.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 279–286. C. MEREGHETTI, G. PIGHIZZINI:             Two-Way Automata Simulations and Unary Languages.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 287–300. V. MITRANA:             On the Degree of Communication in Parallel Communicating Finite Automata Systems.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 301–314. A. PĂUN:             On the Diameter of Various Classes of H Systems.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 315–324. H. SCHMITZ:             Restricted Temporal Logic and Deterministic Languages.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 325–341. J. M. SEMPERE:             On a Class of Regular-like Expressions for Linear Languages.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 343–354. Y. VELINOV:             Regions of Influence in Simple Decomposition Forms of Finite Functions.             Journal of Automata, Languages and Combinatorics 5 (2000) 3, 355–366. 5 (2000) 4 C. CHOFFRUT, M. GOLDWURM:             Timed Automata with Periodic Clock Constraints.             Journal of Automata, Languages and Combinatorics 5 (2000) 4, 371–403. F. OTTO:             On Dehn Functions of Finitely Presented Bi-Automatic Monoids.             Journal of Automata, Languages and Combinatorics 5 (2000) 4, 405–419. I. ROSENBERG, D. SCHWEIGERT:             Locally Maximal Clones II.             Journal of Automata, Languages and Combinatorics 5 (2000) 4, 421–455. L. SUBRAMANIAN, M. TALUPUR, K. KRITHIVASAN, C. P. RANGAN:             On the Generative Power of Simple H Systems.             Journal of Automata, Languages and Combinatorics 5 (2000) 4, 457–473. 6 (2001) 1 C. DIMA:             Real-Time Automata.             Journal of Automata, Languages and Combinatorics 6 (2001) 1, 3–23. H. JÜRGENSEN, M. KATSURA, S. KONSTANTINIDIS:             Maximal Solid Codes.             Journal of Automata, Languages and Combinatorics 6 (2001) 1, 25–50. M. E. NEBEL:             On the Power of Subroutines for Finite State Machines.             Journal of Automata, Languages and Combinatorics 6 (2001) 1, 51–74. G. PĂUN:             P Systems with Active Membranes: Attacking NP-Complete Problems.             Journal of Automata, Languages and Combinatorics 6 (2001) 1, 75–90. P. TURAKAINEN:             Injectivity of the Quotient h  backslash   g of two Morphisms and Ambiguity of Linear Grammars.             Journal of Automata, Languages and Combinatorics 6 (2001) 1, 91–96. D. WÄTJEN, D. OSTROVSKY:             Function-Limited 0L Systems Revisited.             Journal of Automata, Languages and Combinatorics 6 (2001) 1, 97–114. 6 (2001) 2 V. BERTHÉ, L. VUILLON:             Palindromes and Two-Dimensional Sturmian Sequences.             Journal of Automata, Languages and Combinatorics 6 (2001) 2, 121–138. D. BRIDGES, A. MAHALANOBIS:             Increasing, Nondecreasing, and Virtually Continuous Functions.             Journal of Automata, Languages and Combinatorics 6 (2001) 2, 139–143. Z. FÜLÖP:             Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers.             Journal of Automata, Languages and Combinatorics 6 (2001) 2, 145–189. J. HOLUB, C. S. ILIOPOULOS, B. MELICHAR, L. MOUCHARD:             Distributed Pattern Matching Using Finite Automata.             Journal of Automata, Languages and Combinatorics 6 (2001) 2, 191–204. T. PETKOVIC, M. STEINBY:             Piecewise Directable Automata.             Journal of Automata, Languages and Combinatorics 6 (2001) 2, 205–220. S. YU:             State Complexity of Regular Languages.             Journal of Automata, Languages and Combinatorics 6 (2001) 2, 221–234. 6 (2001) 3 M. K. AHMAD, X. AUGROS:             Some Results on Codes for Generalized Factorizations.             Journal of Automata, Languages and Combinatorics 6 (2001) 3, 239–251. K. DENECKE, J. KOPPITZ, S. SHTRAKOV:             The Depth of a Hypersubstitution.             Journal of Automata, Languages and Combinatorics 6 (2001) 3, 253–262. Y. GUESNET:             On Maximal Dense Bifix Codes.             Journal of Automata, Languages and Combinatorics 6 (2001) 3, 263–273. P.-C. HÉAM:             Some Topological Properties of Rational Sets.             Journal of Automata, Languages and Combinatorics 6 (2001) 3, 275–290. C. S. ILIOPOULOS, R. J. SIMPSON:             On-Line Validation and Analysis of Partially Occluded Images.             Journal of Automata, Languages and Combinatorics 6 (2001) 3, 291–303. A. KELAREV, O. SOKRATOVA:             Directed Graphs and Syntactic Algebras of Tree Languages.             Journal of Automata, Languages and Combinatorics 6 (2001) 3, 305–311. R. KEMP:             On the Expected Number of Leftist Nodes in Simply Generated Trees.             Journal of Automata, Languages and Combinatorics 6 (2001) 3, 313–343. S. N. KRISHNA, R. RAMA:             P Systems with Replicated Rewriting.             Journal of Automata, Languages and Combinatorics 6 (2001) 3, 345–350. E. MÄKINEN:             On the Inclusion Problem for Very Simple Deterministic Pushdown Automata.             Journal of Automata, Languages and Combinatorics 6 (2001) 3, 351–357. V. MANCA, C. MARTÍN-VIDE, G. PĂUN:             On the Power of P Systems with Replicated Rewriting.             Journal of Automata, Languages and Combinatorics 6 (2001) 3, 359–374. F. OTTO, N. RUSKUC:             Confluent Monadic String-Rewriting Systems and Automatic Structures.             Journal of Automata, Languages and Combinatorics 6 (2001) 3, 375–388. 6 (2001) 4 Special Issue: Selected Papers of the Second International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27–29, 2000) S. AYDIN, H. JÜRGENSEN, L. E. ROBBINS:             Dialogues as Co-Operating Grammars.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 395–410. H. BORDIHN, M. HOLZER:             On the Number of Active Symbols in L and CD Grammar Systems.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 411–426. P. DÖMÖSI, Z. ÉSIK:             Homomorphic Simulation and Letichevsky's Criterion.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 427–436. C. GLASSER, H. SCHMITZ:             The Boolean Structure of Dot-Depth One.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 437–452. M. HOLZER, K. SALOMAA, S. YU:             On the State Complexity of k-Entry Deterministic Finite Automata.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 453–466. B. KHOUSSAINOV, S. RUBIN:             Graphs with Automatic Presentations over a Unary Alphabet.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 467–480. M. MILANI, G. PIGHIZZINI:             Tight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 481–492. F. MRÁZ:             Lookahead Hierarchies of Restarting Automata.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 493–506. T. Y. NISHIDA:             Sizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 507–518. A. OKHOTIN:             Conjunctive Grammars.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 519–535. J. SHALLIT, M.-W. WANG:             Automatic Complexity of Strings.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 537–554. K. G. SUBRAMANIAN, D. G. THOMAS, P. H. CHANDRA, M. HOEBERECHTS:             Basic Puzzle Grammars and Generation of Polygons.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 555–568. Y. VELINOV:             On the Regions of Influence in Complex Decomposition Forms of Finite Functions.             Journal of Automata, Languages and Combinatorics 6 (2001) 4, 569–579. 7 (2002) 1 S. V. AVGUSTINOVICH, A. E. FRID:             Words Avoiding Abelian Inclusions.             Journal of Automata, Languages and Combinatorics 7 (2002) 1, 3–9. J. ENGELFRIET, Z. FÜLÖP, H. VOGLER:             Bottom-Up and Top-Down Tree Series Transformations.             Journal of Automata, Languages and Combinatorics 7 (2002) 1, 11–70. F. GÉCSEG, B. IMREH:             On Monotone Automata and Monotone Languages.             Journal of Automata, Languages and Combinatorics 7 (2002) 1, 71–82. L. HADDAD, H. MACHIDA, I. G. ROSENBERG:             Maximal and Minimal Partial Clones.             Journal of Automata, Languages and Combinatorics 7 (2002) 1, 83–93. C. MEREGHETTI, B. PALANO:             The Parallel Complexity of Deterministic and Probabilistic Automata.             Journal of Automata, Languages and Combinatorics 7 (2002) 1, 95–108. A. R. MEYER, A. RABINOVICH:             Valid Identity Problem for Shuffle Regular Expressions.             Journal of Automata, Languages and Combinatorics 7 (2002) 1, 109–125. E. PELUSO, J. GOLDSTINE, S. PHOHA:             Normal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event Systems.             Journal of Automata, Languages and Combinatorics 7 (2002) 1, 127–142. H.-J. SHYR:             Regular Nests.             Journal of Automata, Languages and Combinatorics 7 (2002) 1, 143–157. 7 (2002) 2 Special Issue: Selected Papers of the Workshop on Logic and Algebra for Concurrency (Dresden, Germany, September 13–16, 2000) P. BOUYER, A. PETIT:             A Kleene/Büchi-like Theorem for Clock Languages.             Journal of Automata, Languages and Combinatorics 7 (2002) 2, 167–186. D. KUSKE, R. MORIN:             Pomsets for Local Trace Languages.             Journal of Automata, Languages and Combinatorics 7 (2002) 2, 187–224. D. PELED, M. Y. VARDI, M. YANNAKAKIS:             Black Box Checking.             Journal of Automata, Languages and Combinatorics 7 (2002) 2, 225–246. P. TESSON, D. THÉRIEN:             The Computing Power of Programs over Finite Monoids.             Journal of Automata, Languages and Combinatorics 7 (2002) 2, 247–258. I. WALUKIEWICZ:             Local Logics for Traces.             Journal of Automata, Languages and Combinatorics 7 (2002) 2, 259–290. 7 (2002) 3 T. A. AL-HAWARY:             Characterizations of Certain Matroids via Flats.             Journal of Automata, Languages and Combinatorics 7 (2002) 3, 295–301. C. CÂMPEANU, K. SALOMAA, S. YU:             Tight Lower Bound for the State Complexity of Shuffle of Regular Languages.             Journal of Automata, Languages and Combinatorics 7 (2002) 3, 303–310. C. GERMAIN, J. PALLO:             Linear Languages with a Nonassociative Concatenation.             Journal of Automata, Languages and Combinatorics 7 (2002) 3, 311–320. M. MOHRI:             Semiring Frameworks and Algorithms for Shortest-Distance Problems.             Journal of Automata, Languages and Combinatorics 7 (2002) 3, 321–350. M. RIGO, A. MAES:             More on Generalized Automatic Sequences.             Journal of Automata, Languages and Combinatorics 7 (2002) 3, 351–376. D.-C. VOINESCU:             On the Combinatorial Alphabets of a Language.             Journal of Automata, Languages and Combinatorics 7 (2002) 3, 377–394. L. ZHANG, K. INOUE, A. ITO, Y. WANG:             A Leaf-Size Hierarchy of Alternating Rebound Turing Machines.             Journal of Automata, Languages and Combinatorics 7 (2002) 3, 395–410. 7 (2002) 4 Special Issue: Selected Papers of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (Vienna, Austria, July 20–22, 2001) H. N. ADORNA:             3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 419–432. K. ARTHI, K. KRITHIVASAN, E. CSUHAJ-VARJÚ:             On Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 433–446. H. BORDIHN, B. REICHEL:             On Descriptions of Context-Free Languages by CD Grammar Systems.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 447–454. M. DOMARATZKI:             State Complexity of Proportional Removals.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 455–468. M. DOMARATZKI, D. KISMAN, J. SHALLIT:             On the Number of Distinct Languages Accepted by Finite Automata with n States.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 469–486. H. FERNAU, M. HOLZER:             Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 487–503. K. HASHIGUCHI, T. KUNAI, S. JIMBO:             Finite Codes over Free Binoids.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 505–518. J. HROMKOVIC:             Descriptional Complexity of Finite Automata: Concepts and Open Problems.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 519–531. M. KUTRIB:             Refining Nondeterminism Below Linear Time.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 533–547. A. MALCHER:             Descriptional Complexity of Cellular Automata and Decidability Questions.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 549–560. C. MARTÍN-VIDE, V. MITRANA:             Grammars with Bounded-Life Resources.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 561–570. A. MEDUNA:             Descriptional Complexity of Scattered Rewriting and Multirewriting: An Overview.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 571–577. P. SÉÉBOLD:             About some Overlap-Free Morphisms on a n-Letter Alphabet.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 579–597. F. L. TIPLEA, E. MÄKINEN:             On the Complexity of a Problem on Monadic String Rewriting Systems.             Journal of Automata, Languages and Combinatorics 7 (2002) 4, 599–609. 8 (2003) 1 F. DREWES, R. KLEMPIEN-HINRICHS, H.-J. KREOWSKI:             Table-Driven and Context-Sensitive Collage Languages.             Journal of Automata, Languages and Combinatorics 8 (2003) 1, 5–24. D. ERMEL, D. WÄTJEN:             Limited IL Systems.             Journal of Automata, Languages and Combinatorics 8 (2003) 1, 25–42. S. KITAEV:             There are no Iterated Morphisms that Define the Arshon Sequence and the σ-Sequence.             Journal of Automata, Languages and Combinatorics 8 (2003) 1, 43–50. J. LIEBEHENSCHEL:             On the Connection Between Lexicographical Generation and Ranking.             Journal of Automata, Languages and Combinatorics 8 (2003) 1, 51–57. E. PETRE:             Watson-Crick ω-Automata.             Journal of Automata, Languages and Combinatorics 8 (2003) 1, 59–70. O. RAVSKY:             A New Measure of Asymmetry of Binary Words.             Journal of Automata, Languages and Combinatorics 8 (2003) 1, 71–74. O. RAVSKY:             On the Palindromic Decomposition of Binary Words.             Journal of Automata, Languages and Combinatorics 8 (2003) 1, 75–83. D. WÄTJEN:             Remarks on Simple Eco-Grammar Systems with Prescribed Teams.             Journal of Automata, Languages and Combinatorics 8 (2003) 1, 85–108. 8 (2003) 2 Special Issue: Selected Papers of the Workshop Weighted Automata: Theory and Applications (Dresden, Germany, March 4–8, 2002) C. ALLAUZEN, M. MOHRI:             Efficient Algorithms for Testing the Twins Property.             Journal of Automata, Languages and Combinatorics 8 (2003) 2, 117–144. S. L. BLOOM, Z. ÉSIK:             An Extension Theorem with an Application to Formal Tree Series.             Journal of Automata, Languages and Combinatorics 8 (2003) 2, 145–185. P. BUCHHOLZ, P. KEMPER:             Weak Bisimulation for ( max /+) Automata and Related Models.             Journal of Automata, Languages and Combinatorics 8 (2003) 2, 187–218. Z. ÉSIK, W. KUICH:             Formal Tree Series.             Journal of Automata, Languages and Combinatorics 8 (2003) 2, 219–285. B. KHOUSSAINOV, S. RUBIN:             Automatic Structures: Overview and Future Directions.             Journal of Automata, Languages and Combinatorics 8 (2003) 2, 287–301. C. MARTÍN-VIDE, V. MITRANA, R. STIEBE:             Weighted Grammars and Automata with Threshold Interpretation.             Journal of Automata, Languages and Combinatorics 8 (2003) 2, 303–318. J. J. M. M. RUTTEN:             Coinductive Counting with Weighted Automata.             Journal of Automata, Languages and Combinatorics 8 (2003) 2, 319–352. L. STAIGER:             Weighted Finite Automata and Metrics in Cantor Space.             Journal of Automata, Languages and Combinatorics 8 (2003) 2, 353–360. E. W. STARK:             On Behaviour Equivalence for Probabilistic I/O Automata and its Relationship to Probabilistic Bisimulation.             Journal of Automata, Languages and Combinatorics 8 (2003) 2, 361–395. 8 (2003) 3 M. S. BALAN, K. KRITHIVASAN, M. MADHU:             Some Variants in Communication of Parallel Communicating Pushdown Automata.             Journal of Automata, Languages and Combinatorics 8 (2003) 3, 401–416. B. BORCHARDT, H. VOGLER:             Determinization of Finite State Weighted Tree Automata.             Journal of Automata, Languages and Combinatorics 8 (2003) 3, 417–463. F. D'ALESSANDRO:             On the Complexity of Simon Automata over the Dyck Language.             Journal of Automata, Languages and Combinatorics 8 (2003) 3, 465–476. M. DALEY, O. H. IBARRA, L. KARI, I. MCQUILLAN, K. NAKANO:             The ld and dlad Bio-Operations on Formal Languages.             Journal of Automata, Languages and Combinatorics 8 (2003) 3, 477–498. F. DREWES, S. EWERT, R. KLEMPIEN-HINRICHS, H.-J. KREOWSKI:             Computing Raster Images from Grid Picture Grammars.             Journal of Automata, Languages and Combinatorics 8 (2003) 3, 499–519. C.-M. FAN, H.-J. SHYR:             Languages Related to the Properties of Disjunctivity and Code.             Journal of Automata, Languages and Combinatorics 8 (2003) 3, 521–538. B. IMREH, C. IMREH, M. ITO:             On Monotonic Directable Nondeterministic Automata.             Journal of Automata, Languages and Combinatorics 8 (2003) 3, 539–547. 8 (2003) 4 Special Issue: Selected Papers of the 13th Australasian Workshop on Combinatorial Algorithms (Kingfisher Bay Resort, Fraser Island, Queensland, Australia, July 7–10, 2002) S. N. BEREG, A. V. KELAREV:             An Algorithm for Analysis of Images in Spatial Information Systems.             Journal of Automata, Languages and Combinatorics 8 (2003) 4, 557–565. N. J. CAVENAGH:             Latin Trade Algorithms and the Smallest Critical Set in a Latin Square.             Journal of Automata, Languages and Combinatorics 8 (2003) 4, 567–578. F. FRANEK, W. F. SMYTH, Y. TANG:             Computing All Repeats Using Suffix Arrays.             Journal of Automata, Languages and Combinatorics 8 (2003) 4, 579–591. F. FRANEK, J. HOLUB, W. F. SMYTH, X. XIAO:             Computing Quasi Suffix Arrays.             Journal of Automata, Languages and Combinatorics 8 (2003) 4, 593–606. G. LAGOGIANNIS, C. MAKRIS, Y. PANAGIS, S. SIOUTAS, K. TSICHLAS:             New Dynamic Balanced Search Trees with Worst-Case Constant Update Time.             Journal of Automata, Languages and Combinatorics 8 (2003) 4, 607–632. G. LAGOGIANNIS, C. MAKRIS, Y. PANAGIS, S. SIOUTAS, K. TSICHLAS:             Rectangle Enclosure Reporting in Linear Space Revisited.             Journal of Automata, Languages and Combinatorics 8 (2003) 4, 633–645. A. LEFEBVRE, T. LECROQ, J. ALEXANDRE:             An Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle.             Journal of Automata, Languages and Combinatorics 8 (2003) 4, 647–657. C. C. LINDNER:             A Small Embedding for Partial 4-Cycle Systems when the Leave is Small.             Journal of Automata, Languages and Combinatorics 8 (2003) 4, 659–662. P. MANYEM, R. L. SALT, M. S. VISSER:             Approximation Lower Bounds in Online LIB Bin Packing and Covering.             Journal of Automata, Languages and Combinatorics 8 (2003) 4, 663–674. A. N. M. SALMAN, H. BROERSMA, E. T. BASKORO:             Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs.             Journal of Automata, Languages and Combinatorics 8 (2003) 4, 675–681. 9 (2004) 1 Z. ÉSIK, Z. L. NÉMETH:             Higher Dimensional Automata.             Journal of Automata, Languages and Combinatorics 9 (2004) 1, 3–29. Z. FÜLÖP, H. VOGLER:             Weighted Tree Transducers.             Journal of Automata, Languages and Combinatorics 9 (2004) 1, 31–54. F. GÉCSEG, B. IMREH:             On Definite and Nilpotent DR Tree Languages.             Journal of Automata, Languages and Combinatorics 9 (2004) 1, 55–60. G. GUAIANA, A. RESTIVO, S. SALEMI:             On the Trace Product and some Families of Languages Closed under Partial Commutations.             Journal of Automata, Languages and Combinatorics 9 (2004) 1, 61–79. H. JÜRGENSEN, S. KONSTANTINIDIS, N. H. LÂM:             Asymptotically Optimal Low-Cost Solid Codes.             Journal of Automata, Languages and Combinatorics 9 (2004) 1, 81–102. J. NÉRAUD, C. SELMI:             A Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A*.             Journal of Automata, Languages and Combinatorics 9 (2004) 1, 103–110. Y. SAKAKIBARA, H. IMAI:             A DNA-Based Computational Model Using a Specific Type of Restriction Enzymes.             Journal of Automata, Languages and Combinatorics 9 (2004) 1, 111–119. N. SANTEAN:             Bimachines and Structurally-Reversed Automata.             Journal of Automata, Languages and Combinatorics 9 (2004) 1, 121–146. P. WEIL:             On the Logical Definability of Certain Graph and Poset Languages.             Journal of Automata, Languages and Combinatorics 9 (2004) 1, 147–165. 9 (2004) 2/3 Special Issue: Selected Papers of the Fourth International Workshop on Descriptional Complexity of Formal Systems (London, Ontario, Canada, August 21–25, 2002) H. BORDIHN, M. HOLZER, M. KUTRIB:             Economy of Description for Basic Constructions on Rational Transductions.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 175–188. C. CÂMPEANU, W. H. HO:             The Maximum State Complexity for Finite Languages.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 189–202. J.-M. CHAMPARNAUD, G. HANSEL, T. PARANTHOËN, D. ZIADI:             Random Generation Models for NFAs.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 203–216. M. DOMARATZKI, K. SALOMAA:             State Complexity of Shuffle on Trajectories.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 217–232. K. ELLUL, B. KRAWETZ, J. SHALLIT, M.-W. WANG:             Regular Expressions: New Results and Open Problems.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 233–256. M. G. ERAMIAN:             Efficient Simulation of Nondeterministic Weighted Finite Automata.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 257–267. C. GROZEA:             NP Predicates Computable in the Weakest Level of the Grzegorczyck Hierarchy.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 269–279. M. KAPPES, C. M. R. KINTALA:             Tradeoffs Between Reliability and Conciseness of Deterministic Finite Automata.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 281–292. L. KARI, S. KONSTANTINIDIS:             Descriptional Complexity of Error/Edit Systems.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 293–309. M. MADHU:             Descriptional Complexity of Rewriting P Systems.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 311–316. I. MCQUILLAN:             Descriptional Complexity of Block-Synchronization Context-Free Grammars.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 317–332. C. MILLER:             Context Derivation Sets and Context-Free Normal Forms.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 333–345. F. NIESSNER:             Büchi Automata and Their Degrees of Nondeterminism and Ambiguity.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 347–363. A. OKHOTIN:             State Complexity of Linear Conjunctive Grammars.             Journal of Automata, Languages and Combinatorics 9 (2004) 2/3, 365–381. 9 (2004) 4 R. FREUND, M. OSWALD:             P Systems with Conditional Communication Rules Assigned to Membranes.             Journal of Automata, Languages and Combinatorics 9 (2004) 4, 387–397. M. LATTEUX:             Valence Languages Generated by Equality Sets.             Journal of Automata, Languages and Combinatorics 9 (2004) 4, 399–406. F. OTTO:             Some Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages.             Journal of Automata, Languages and Combinatorics 9 (2004) 4, 407–437. S. KITAEV, T. MANSOUR, P. SÉÉBOLD:             Generating the Peano Curve and Counting Occurrences of some Patterns.             Journal of Automata, Languages and Combinatorics 9 (2004) 4, 439–455. M. MADHU, K. KRITHIVASAN:             Length Synchronization Context-Free Grammars.             Journal of Automata, Languages and Combinatorics 9 (2004) 4, 457–464. 10 (2005) 1 M. ANSELMO, M. MADONIA:             A Language-Theoretic Approach to Covering Problems.             Journal of Automata, Languages and Combinatorics 10 (2005) 1, 3–24. M. H. ARMANIOUS:             Cubic and Semi-Cubic SQS-Skeins.             Journal of Automata, Languages and Combinatorics 10 (2005) 1, 25–35. J. CZYZOWICZ, W. FRACZAK, A. PELC:             Transducers with Set Output.             Journal of Automata, Languages and Combinatorics 10 (2005) 1, 37–49. J.-P. DUVAL, T. LECROQ, A. LEFEBVRE:             Border Array on Bounded Alphabet.             Journal of Automata, Languages and Combinatorics 10 (2005) 1, 51–60. T. Y. NISHIDA:             Some New Aspects of Word-Length Controlled DT0L Systems.             Journal of Automata, Languages and Combinatorics 10 (2005) 1, 61–77. A. PANHOLZER:             Gröbner Bases and the Defining Polynomial of a Context-Free Grammar Generating Function.             Journal of Automata, Languages and Combinatorics 10 (2005) 1, 79–97. 10 (2005) 2/3 Special Issue: Selected Papers of the Workshop Weighted Automata: Theory and Applications (Dresden, Germany, June 1–5, 2004) B. BORCHARDT, Z. FÜLÖP, Z. GAZDAG, A. MALETTI:             Bounds for Tree Automata with Polynomial Costs.             Journal of Automata, Languages and Combinatorics 10 (2005) 2/3, 107–157. S. BOZAPALIDIS, A. GRAMMATIKOPOULOU:             Recognizable Picture Series.             Journal of Automata, Languages and Combinatorics 10 (2005) 2/3, 159–183. G. R. SYMEON BOZAPALIDIS:             On the Closure of Recognizable Tree Series Under Tree Homomorphisms.             Journal of Automata, Languages and Combinatorics 10 (2005) 2/3, 185–202. Z. ÉSIK, W. KUICH:             A Semiring-Semimodule Generalization of ω-Regular Languages I.             Journal of Automata, Languages and Combinatorics 10 (2005) 2/3, 203–242. Z. ÉSIK, W. KUICH:             A Semiring-Semimodule Generalization of ω-Regular Languages II.             Journal of Automata, Languages and Combinatorics 10 (2005) 2/3, 243–264. M. GIRAUD, D. LAVENIER:             Dealing with Hardware Space Limits when Removing Epsilon-Transitions in a Genomic Weighted Finite Automaton.             Journal of Automata, Languages and Combinatorics 10 (2005) 2/3, 265–285. D. KIRSTEN, I. MÄURER:             On the Determinization of Weighted Automata.             Journal of Automata, Languages and Combinatorics 10 (2005) 2/3, 287–312. I. MEINECKE:             The Hadamard Product of Sequential-Parallel Series.             Journal of Automata, Languages and Combinatorics 10 (2005) 2/3, 313–346. G. TISCHLER:             Properties and Applications of Parametric Weighted Finite Automata.             Journal of Automata, Languages and Combinatorics 10 (2005) 2/3, 347–365. A. ZOLLMANN, K. SIMA'AN:             A Consistent and Efficient Estimator for Data-Oriented Parsing.             Journal of Automata, Languages and Combinatorics 10 (2005) 2/3, 367–388. 10 (2005) 4 P. BOUYER, F. CHEVALIER:             On Conciseness of Extensions of Timed Automata.             Journal of Automata, Languages and Combinatorics 10 (2005) 4, 393–405. K. ELLUL, B. KRAWETZ, J. SHALLIT, M.-W. WANG:             Regular Expressions: New Results and Open Problems.             Journal of Automata, Languages and Combinatorics 10 (2005) 4, 407–437. O. FINKEL:             On the Length of the Wadge Hierarchy of ω-Context Free Languages.             Journal of Automata, Languages and Combinatorics 10 (2005) 4, 439–464. C. FROUGNY, L. VUILLON:             Coding of Two-Dimensional Constraints of Finite Type by Substitutions.             Journal of Automata, Languages and Combinatorics 10 (2005) 4, 465–482. Z. GAZDAG:             Shape Preserving Bottom-Up Tree Transducers.             Journal of Automata, Languages and Combinatorics 10 (2005) 4, 483–534. A. MALETTI, H. VOGLER:             Incomparability Results for Classes of Polynomial Tree Series Transformations.             Journal of Automata, Languages and Combinatorics 10 (2005) 4, 535–568. 10 (2005) 5/6 Special Issue: Selected Papers of the Prague Stringology Conference (Czech Technical University in Prague, Czech Republic, September 22–24, 2003) B. BEHZADI, J.-M. STEYAERT:             The Transformation Distance Problem Revisited.             Journal of Automata, Languages and Combinatorics 10 (2005) 5/6, 577–587. D. CANTONE, S. FARO:             Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm.             Journal of Automata, Languages and Combinatorics 10 (2005) 5/6, 589–608. M. CHRISTODOULAKIS, C. S. ILIOPOULOS, K. PARK, J. S. SIM:             Approximate Seeds of Strings.             Journal of Automata, Languages and Combinatorics 10 (2005) 5/6, 609–626. L. CLEOPHAS, G. ZWAAN, B. W. WATSON:             Constructing Factor Oracles.             Journal of Automata, Languages and Combinatorics 10 (2005) 5/6, 627–640. R. COLE, C. S. ILIOPOULOS, M. MOHAMED, W. F. SMYTH, L. YANG:             The Complexity of the Minimum k-Cover Problem.             Journal of Automata, Languages and Combinatorics 10 (2005) 5/6, 641–653. A. FATHOLAHZADEH:             Learning the Morphological Features of a Large Set of Words.             Journal of Automata, Languages and Combinatorics 10 (2005) 5/6, 655–669. R. GROULT, M. LÉONARD, L. MOUCHARD:             A Linear Algorithm for the Detection of Evolutive Tandem Repeats.             Journal of Automata, Languages and Combinatorics 10 (2005) 5/6, 671–685. C. ILIOPOULOS, L. MOUCHARD, K. PERDIKURI, A. TSAKALIDIS:             Computing the Repetitions in a Biological Weighted Sequence.             Journal of Automata, Languages and Combinatorics 10 (2005) 5/6, 687–696. T. NAKATOH, K. BABA, D. IKEDA, Y. YAMADA, S. HIROKAWA:             An Efficient Mapping for Computing the Score of String Matching.             Journal of Automata, Languages and Combinatorics 10 (2005) 5/6, 697–704. 11 (2006) 1 Special Issue: Selected Papers of the International Workshop on Security Analysis of Systems: Formalisms and Tools (Orléans, France, June 21–22, 2004) M. BAUDET:             Random Polynomial-Time Attacks and Dolev-Yao Models.             Journal of Automata, Languages and Combinatorics 11 (2006) 1, 7–21. J. CHEN:             Timed Extensions of π Calculus.             Journal of Automata, Languages and Combinatorics 11 (2006) 1, 23–58. H. GRALL:             A Confinement Criterion for Securely Executing Mobile Code.             Journal of Automata, Languages and Combinatorics 11 (2006) 1, 59–106. S. LIMET, G. SALZER:             Basic Rewriting via Logic Programming, with an Application to the Reachability Problem.             Journal of Automata, Languages and Combinatorics 11 (2006) 1, 107–142. 11 (2006) 2 P. R. J. ASVELD:             Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form.             Journal of Automata, Languages and Combinatorics 11 (2006) 2, 147–159. F. GÉCSEG, B. IMREH:             On Asynchronous Tree Automata.             Journal of Automata, Languages and Combinatorics 11 (2006) 2, 161–168. O. H. IBARRA, B. RAVIKUMAR, C. E. GEREDE:             Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach.             Journal of Automata, Languages and Combinatorics 11 (2006) 2, 169–188. A. KROKHIN, I. G. ROSENBERG:             A Monoidal Interval of Clones of Selfdual Functions.             Journal of Automata, Languages and Combinatorics 11 (2006) 2, 189–208. D. WÄTJEN:             Limited Simple Eco-Grammar Systems with Prescribed Teams.             Journal of Automata, Languages and Combinatorics 11 (2006) 2, 209–231. 11 (2006) 3 Special Issue: Selected Papers dedicated to Membrane Computing R. BRIJDER, M. CAVALIERE, A. RISCOS-NÚÑEZ, G. ROZENBERG, D. SBURLAN:             Communication Membrane Systems with Active Symports.             Journal of Automata, Languages and Combinatorics 11 (2006) 3, 241–261. M. CAVALIERE, R. FREUND, A. LEITSCH, G. PĂUN:             Event-Related Outputs of Computations in P Systems.             Journal of Automata, Languages and Combinatorics 11 (2006) 3, 263–278. Z. DANG, O. H. IBARRA, C. LI, G. XIE:             On the Decidability of Model-Checking for P Systems.             Journal of Automata, Languages and Combinatorics 11 (2006) 3, 279–298. T.-O. ISHDORJ:             Power and Efficiency of Minimal Parallelism in Polarizationless P Systems.             Journal of Automata, Languages and Combinatorics 11 (2006) 3, 299–320. J. KLEIJN, M. KOUTNY, G. ROZENBERG:             Process Semantics for Membrane Systems.             Journal of Automata, Languages and Combinatorics 11 (2006) 3, 321–340. 11 (2006) 4 M. H. TER BEEK, G. LENZINI, M. PETROCCHI:             A Team Automaton Scenario for the Analysis of Security Properties of Communication Protocols.             Journal of Automata, Languages and Combinatorics 11 (2006) 4, 345–374. D. GENOVA, N. JONOSKA:             Topological Properties of Forbidding-Enforcing Systems.             Journal of Automata, Languages and Combinatorics 11 (2006) 4, 375–397. L. HADDAD, D. LAU, I. G. ROSENBERG:             Intervals of Partial Clones Containing Maximal Clones.             Journal of Automata, Languages and Combinatorics 11 (2006) 4, 399–421. M. J. P. JIMÉNEZ, A. R. JIMÉNEZ, F. S. CAPARRINI:             A Polynomial Complexity Class in P Systems Using Membrane Division.             Journal of Automata, Languages and Combinatorics 11 (2006) 4, 423–434. B. SUNCKEL:             On the Descriptional Complexity of External Hybrid Cooperating Distributed Grammar Systems.             Journal of Automata, Languages and Combinatorics 11 (2006) 4, 435–447. 12 (2007) 1/2 Special Issue: Selected Papers of the 7th Workshop on Descriptional Complexity of Formal Systems (Como, Italy, June 30 – July 2, 2005) F. BIEGLER:             Synchronization Functions of Synchronized Context-Free Grammars and Languages.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 7–24. H. BORDIHN, H. FERNAU:             The Degree of Parallelism.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 25–47. H. BORDIHN, B. SUNCKEL:             On Active Symbols in CD Grammar Systems.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 49–67. C. CÂMPEANU, N. SANTEAN, S. YU:             A Family of NFAs Free of State Reductions.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 69–78. M. DOMARATZKI, A. OKHOTIN, J. SHALLIT:             Enumeration of Context-Free Languages and Related Structures.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 79–95. B. DURAK:             Two-Way Finite Automata with a Write-Once Track.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 97–115. H. FERNAU, R. FREUND, M. OSWALD, K. REINHARDT:             Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 117–138. V. GEFFERT:             State Hierarchy for One-Way Finite Automata.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 139–145. G. GRAMLICH, R. HERRMANN:             Learning Unary Automata.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 147–165. M. A. GUTIÉRREZ-NARANJO, M. J. PÉREZ-JIMÉNEZ, A. RISCOS-NÚÑEZ:             Multi-dimensional Descriptional Complexity of P Systems.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 167–179. Y.-S. HAN, G. TRIPPEN, D. WOOD:             Simple-Regular Expressions and Languages.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 181–194. M. HOLZER, M. KUTRIB, J. REIMANN:             Non-Recursive Trade-Offs for Deterministic Restarting Automata.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 195–213. C. A. KAPOUTSIS:             Deterministic Moles Cannot Solve Liveness.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 215–235. M. KRÉSZ:             Graph Decomposition and Descriptional Complexity of Soliton Automata.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 237–263. A. MALCHER:             On Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown Automata.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 265–277. L. POLÁK:             Remarks on Multiple Entry Deterministic Finite Automata.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 279–288. B. SUNCKEL:             On the Descriptional Complexity of CD Grammar Systems of Finite Index.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 289–306. G. VASZIL:             Non-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 307–315. S. VERLAN:             On Minimal Context-Free Insertion-Deletion Systems.             Journal of Automata, Languages and Combinatorics 12 (2007) 1/2, 317–328. 12 (2007) 3 F. DREWES, H. VOGLER:             Learning Deterministically Recognizable Tree Series.             Journal of Automata, Languages and Combinatorics 12 (2007) 3, 333–354. P. JANCAR, F. MRÁZ, M. PLÁTEK, J. VOGEL:             Monotonicity of Restarting Automata.             Journal of Automata, Languages and Combinatorics 12 (2007) 3, 355–371. R. LANOTTE:             Expressive Power of Hybrid Systems with Real Variables, Integer Variables and Arrays.             Journal of Automata, Languages and Combinatorics 12 (2007) 3, 373–405. D. REIDENBACH:             An Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages.             Journal of Automata, Languages and Combinatorics 12 (2007) 3, 407–426. 12 (2007) 4 Special Issue: Selected Papers dedicated to Weighted Automata Z. ÉSIK, W. KUICH:             A Semiring-Semimodule Generalization of Transducers and Abstract ω-Families of Power Series.             Journal of Automata, Languages and Combinatorics 12 (2007) 4, 435–454. G. RAHONIS:             Weighted Muller Tree Automata and Weighted Logics.             Journal of Automata, Languages and Combinatorics 12 (2007) 4, 455–483. S. SCHWARZ:             Lukasiewicz Logic and Weighted Logics over MV-Semirings.             Journal of Automata, Languages and Combinatorics 12 (2007) 4, 485–499. C. I. TÎRNĂUCĂ, C. TÎRNĂUCĂ:             Learning Regular Tree Languages from Correction and Equivalence Queries.             Journal of Automata, Languages and Combinatorics 12 (2007) 4, 501–524. G. TISCHLER:             On Computability and some Decision Problems of Parametric Weighted Finite Automata.             Journal of Automata, Languages and Combinatorics 12 (2007) 4, 525–544. J. WALDMANN:             Weighted Automata for Proving Termination of String Rewriting.             Journal of Automata, Languages and Combinatorics 12 (2007) 4, 545–570. 13 (2008) 1 Z. FÜLÖP, L. MUZAMEL:             Circularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers.             Journal of Automata, Languages and Combinatorics 13 (2008) 1, 3–44. S. KITAEV, A. PYATKIN:             On Representable Graphs.             Journal of Automata, Languages and Combinatorics 13 (2008) 1, 45–54. S. KONSTANTINIDIS, P. V. SILVA:             Maximal Error-Detecting Capabilities of Formal Languages.             Journal of Automata, Languages and Combinatorics 13 (2008) 1, 55–71. V. V. LOZIN:             Graph Representation Functions Computable by Finite Automata.             Journal of Automata, Languages and Combinatorics 13 (2008) 1, 73–90. 13 (2008) 2 F. D'ALESSANDRO, S. VARRICCHIO:             On the Growth of Context-Free Languages.             Journal of Automata, Languages and Combinatorics 13 (2008) 2, 95–104. M. S. BALAN:             Complexity Measures for Binding-Blocking Automata.             Journal of Automata, Languages and Combinatorics 13 (2008) 2, 105–123. M. V. P. RAO, V. VINAY:             Quantum Finite Automata and Weighted Automata.             Journal of Automata, Languages and Combinatorics 13 (2008) 2, 125–139. A. ROMAN:             A Note on Cerny Conjecture for Automata over 3-Letter Alphabet.             Journal of Automata, Languages and Combinatorics 13 (2008) 2, 141–143. I. TOMESCU:             Threshold Properties of Some Periodic Factors of Words over a Finite Alphabet.             Journal of Automata, Languages and Combinatorics 13 (2008) 2, 145–156. 13 (2008) 3/4 B. BORCHERT:             Formal Language Characterizations of P, NP, and PSPACE.             Journal of Automata, Languages and Combinatorics 13 (2008) 3/4, 161–183. M. DALEY, M. ERAMIAN, I. MCQUILLAN:             The Bag Automaton: A Model of Nondeterministic Storage.             Journal of Automata, Languages and Combinatorics 13 (2008) 3/4, 185–206. R. DE SOUZA, N. KOBAYASHI:             A Combinatorial Study of k-Valued Rational Relations.             Journal of Automata, Languages and Combinatorics 13 (2008) 3/4, 207–231. S. Z. FAZEKAS, B. NAGY:             Scattered Subword Complexity of non-Primitive Words.             Journal of Automata, Languages and Combinatorics 13 (2008) 3/4, 233–247. M. KAMBITES, F. OTTO:             Church-Rosser Groups and Growing Context-Sensitive Groups.             Journal of Automata, Languages and Combinatorics 13 (2008) 3/4, 249–267. Z.-Z. LI, H.-J. SHYR, Y.-S. TSAI:             Automata Accepting Bifix Codes.             Journal of Automata, Languages and Combinatorics 13 (2008) 3/4, 269–297. A. OKHOTIN:             Homomorphisms Preserving Linear Conjunctive Languages.             Journal of Automata, Languages and Combinatorics 13 (2008) 3/4, 299–305. 14 (2009) 1 Special Issue: Selected Papers dedicated to the 65th Birthday of Detlef Wotschke J. DASSOW, A. MALCHER:             Editorial.             Journal of Automata, Languages and Combinatorics 14 (2009) 1, 5–6. H. BORDIHN, B. SUNCKEL:             Descriptional Complexity of Restricted CD Grammar Systems.             Journal of Automata, Languages and Combinatorics 14 (2009) 1, 7–22. J. HROMKOVIC, G. SCHNITGER:             Lower Bounds on the Size of Sweeping Automata.             Journal of Automata, Languages and Combinatorics 14 (2009) 1, 23–31. H. JÜRGENSEN:             Markers and Deterministic Acceptors for Non-Deterministic Languages.             Journal of Automata, Languages and Combinatorics 14 (2009) 1, 33–62. C. M. KINTALA:             Software Rejuvenation in Embedded Systems.             Journal of Automata, Languages and Combinatorics 14 (2009) 1, 63–73. A. KLEIN, M. KUTRIB:             Self-Assembling Finite Automata.             Journal of Automata, Languages and Combinatorics 14 (2009) 1, 75–92. H. LEUNG:             A Technique for Proving Lower Bounds on the Size of Sweeping Automata.             Journal of Automata, Languages and Combinatorics 14 (2009) 1, 93–105. G. PIGHIZZINI:             Nondeterministic One-Tape Off-Line Turing Machines.             Journal of Automata, Languages and Combinatorics 14 (2009) 1, 107–124. 14 (2009) 2 A. BERNINI, L. FERRARI, R. PINZANI:             Enumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three.             Journal of Automata, Languages and Combinatorics 14 (2009) 2, 129–147. O. CARTON, J.-E. PIN, X. SOLER-ESCRIVÀ:             Languages Recognized by Finite Supersoluble Groups.             Journal of Automata, Languages and Combinatorics 14 (2009) 2, 149–161. A. CERNY:             On Fair Words.             Journal of Automata, Languages and Combinatorics 14 (2009) 2, 163–174. B. NAGY:             Languages Generated by Context-Free Grammars Extended by Type AB to BA Rules.             Journal of Automata, Languages and Combinatorics 14 (2009) 2, 175–186. T. Y. NISHIDA:             An Efficient Derivation Method for DT0L Systems and a Measure of Derivation Complexity.             Journal of Automata, Languages and Combinatorics 14 (2009) 2, 187–198. 14 (2009) 3/4 M. HUOVA:             A Note on Defect Theorems for 2-Dimensional Words and Trees.             Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 203–209. N. LIMAYE, M. MAHAJAN, A. MEYER:             On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.             Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 211–235. T. MANSOUR, A. O. MUNAGI:             Enumeration of Gap-Bounded Set Partitions.             Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 237–245. K. RUOHNEN:             Equivalence of Set- and Bag-Valued Orbits.             Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 247–253. A. SAARELA:             Ultimately Constant Abelian Complexity of Infinite Words.             Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 255–258. Z. WANG, F. LIANG, Y. HE, D. YANG:             Semiring Structures of some Classes of Hypercodes.             Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 259–272. D. WÄTJEN:             Multi-limited Simple Eco-Grammar Systems with Prescribed Teams.             Journal of Automata, Languages and Combinatorics 14 (2009) 3/4, 273–296. 15 (2010) 1/2 Special Issue: Selected Papers of the 11th Workshop on Descriptional Complexity of Formal Systems (Magdeburg, Germany, July 6 – 9, 2009) J. DASSOW, G. PIGHIZZINI, B. TRUTHE:             Editorial.             Journal of Automata, Languages and Combinatorics 15 (2010) 1/2, 5–5. M. ALMEIDA, N. MOREIRA, R. REIS:             Testing the Equivalence of Regular Languages.             Journal of Automata, Languages and Combinatorics 15 (2010) 1/2, 7–25. P.-Y. ANGRAND, S. LOMBARDY, J. SAKAROVITCH:             On the Number of Broken Derived Terms of a Rational Expression.             Journal of Automata, Languages and Combinatorics 15 (2010) 1/2, 27–51. F. BIEGLER, M. DALEY, I. MCQUILLAN:             On the Shuffle Automaton Size for Words.             Journal of Automata, Languages and Combinatorics 15 (2010) 1/2, 53–70. J. BRZOZOWSKI:             Quotient Complexity of Regular Languages.             Journal of Automata, Languages and Combinatorics 15 (2010) 1/2, 71–89. E. CSUHAJ-VARJÚ, G. VASZIL:             On the Descriptional Complexity of Context-Free Non-returning PC Grammar Systems.             Journal of Automata, Languages and Combinatorics 15 (2010) 1/2, 91–105. H. GRUBER, M. HOLZER, M. KUTRIB:             On Measuring Non-recursive Trade-Offs.             Journal of Automata, Languages and Combinatorics 15 (2010) 1/2, 107–120. G. JIRÁSKOVÁ, A. OKHOTIN:             Nondeterministic State Complexity of Positional Addition.             Journal of Automata, Languages and Combinatorics 15 (2010) 1/2, 121–133. M. KUTRIB, A. MALCHER:             One-Way Cellular Automata, Bounded Languages, and Minimal Communication.             Journal of Automata, Languages and Combinatorics 15 (2010) 1/2, 135–153. R. LOOS, F. MANEA, V. MITRANA:             Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections.             Journal of Automata, Languages and Combinatorics 15 (2010) 1/2, 155–174. R. STIEBE, S. TURAEV:             Capacity-Bounded Grammars.             Journal of Automata, Languages and Combinatorics 15 (2010) 1/2, 175–194. 15 (2010) 3/4 F. BLANCHET-SADRI, M. CUCURINGU:             Counting Primitive Partial Words.             Journal of Automata, Languages and Combinatorics 15 (2010) 3/4. M. BÜCHSE, J. MAY, H. VOGLER:             Determinization of Weighted Tree Automata Using Factorizations.             Journal of Automata, Languages and Combinatorics 15 (2010) 3/4. J. HONKALA:             Ultimately Periodic Languages.             Journal of Automata, Languages and Combinatorics 15 (2010) 3/4. S. HORVÁTH, M. KUDLEK:             A Complete Density Range of Continuum-Many Non-Context-Free Languages Fulfilling Strong Iteration Properties.             Journal of Automata, Languages and Combinatorics 15 (2010) 3/4. S. KONSTANTINIDIS, J. YOUNG:             f-Words and Binary Solid Codes.             Journal of Automata, Languages and Combinatorics 15 (2010) 3/4. E. D. SCHWAB:             On Fibonacci and Thue-Morse Words.             Journal of Automata, Languages and Combinatorics 15 (2010) 3/4.