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

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.