Abstract is missing.
- Computational Processes in Living Cells: Gene Assembly in CiliatesTero Harju, Grzegorz Rozenberg. 1-20 [doi]
- Experimental Quantum Computation with MoleculesMasahiro Kitagawa. 21-27 [doi]
- Efficient Transformations from Regular Expressions to Finite AutomataSebastian Seibert. 28-42 [doi]
- Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished GeneratorsZoltán Ésik. 43-58 [doi]
- A Remark about Quadratic Trace EquationsVolker Diekert, Manfred Kufleitner. 59-66 [doi]
- Infinite Snake Tiling ProblemsJarkko Kari. 67-77 [doi]
- Decision Problems for Linear and Circular Splicing SystemsPaola Bonizzoni, Clelia de Felice, Giancarlo Mauri, Rosalba Zizza. 78-92 [doi]
- Finite Automata Models of Quantized Systems: Conceptual Status and OutlookKarl Svozil. 93-102 [doi]
- Automata on Linear OrderingsVéronique Bruyère, Olivier Carton. 103-115 [doi]
- Some Properties of Ciliate Bio-operationsMark Daley, Lila Kari. 116-127 [doi]
- On the Descriptional Complexity of Some Variants of Lindenmayer SystemsJürgen Dassow, Taishin Y. Nishida, Bernd Reichel. 128-139 [doi]
- Carriers and Counters: P Systems with Carriers vs. (Blind) Counter AutomataHendrik Jan Hoogeboom. 140-151 [doi]
- On the Separation between k-Party and (k-1)-Party Nondeterministic Message ComplexitiesHenry N. Adorna. 152-161 [doi]
- Unary Language Operations and Their Nondeterministic State ComplexityMarkus Holzer, Martin Kutrib. 162-172 [doi]
- Constructing Infinite Words of Intermediate ComplexityJulien Cassaigne. 173-184 [doi]
- A Space Lower Bound of Two-Dimensional Probabilistic Turing MachinesYuji Sasaki, Katsushi Inoue, Akira Ito, Yue Wang. 185-196 [doi]
- Undecidability of Weak Bisimilarity for PA-ProcessesJirí Srba. 197-208 [doi]
- Improved Bounds on the Number of Automata Accepting Finite LanguagesMichael Domaratzki. 209-219 [doi]
- Roots and Powers of Regular LanguagesSándor Horváth, Peter Leupold, Gerhard Lischke. 220-230 [doi]
- Innermost Termination of Context-Sensitive RewritingJürgen Giesl, Aart Middeldorp. 231-244 [doi]
- A Unique Structure of Two-Generated Binary Equality SetsStepan Holub. 245-257 [doi]
- On Deterministic Finite Automata and Syntactic Monoid SizeMarkus Holzer, Barbara König. 258-269 [doi]
- An Inverse Automata Algorithm for Recognizing 2-Collapsing WordsDimitry S. Ananichev, Alessandra Cherubini, Mikhail V. Volkov. 270-282 [doi]
- Efficient Algorithm for Checking Multiplicity Equivalence for the Finite Z-Sigma:::*:::-AutomataKostyantyn Archangelsky. 283-289 [doi]
- Some Remarks on Asynchronous AutomataBalázs Imreh. 290-296 [doi]
- Tiling Systems over Infinite Pictures and Their Acceptance ConditionsJan-Henrik Altenbernd, Wolfgang Thomas, Stefan Wöhrle. 297-306 [doi]
- The Average Lengths of the Factors of the Standard Factorization of Lyndon WordsFrédérique Bassino, Julien Clément, Cyril Nicaud. 307-318 [doi]
- Circular Words Avoiding PatternsJames D. Currie, D. Sean Fitzpatrick. 319-325 [doi]
- Safety Verification for Two-Way Finite Automata with Monotonic CountersOscar H. Ibarra, Zhe Dang, Zhi-Wei Sun. 326-338 [doi]
- An Infinite Prime Sequence Can Be Generated in Real-Time by a 1-Bit Inter-cell Communication Cellular AutomatonHiroshi Umeo, Naoki Kamikawa. 339-348 [doi]
- On the Structure of Graphic DLI-SetsLászló Kászonyi. 349-356 [doi]
- Finite Completion of Comma-Free Codes. Part INguyen Huong Lam. 357-368 [doi]
- On a Family of Codes with Bounded Deciphering DelayDo Long Van, Igor Litovsky. 369-380 [doi]
- Abstract Families of GraphsTanguy Urvoy. 381-392 [doi]
- Automaton Representation of Linear Conjunctive LanguagesAlexander Okhotin. 393-404 [doi]
- On-Line Odometers for Two-Sided Symbolic Dynamical SystemsChristiane Frougny. 405-416 [doi]
- Characteristic Semigroups of Directable AutomataTatjana Petkovic, Miroslav Ciric, Stojan Bogdanovic. 417-427 [doi]