Abstract is missing.
- Counting with Probabilistic and Ultrametric Finite AutomataKaspars Balodis. 3-16 [doi]
- Systolic Automata and P SystemsRoberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Giovanni Pardini, Simone Tini. 17-31 [doi]
- Soliton Automata with Multiple WavesHenning Bordihn, Helmut Jürgensen, Heiko Ritter. 32-48 [doi]
- On Power Series over a Graded MonoidZoltán Ésik, Werner Kuich. 49-55 [doi]
- Advances on Random Sequence Generation by Uniform Cellular AutomataEnrico Formenti, Katsunobu Imai, Bruno Martin, Jean-Baptiste Yunès. 56-70 [doi]
- On the Determinization Blowup for Finite Automata Recognizing Equal-Length LanguagesJuhani Karhumäki, Alexander Okhotin. 71-82 [doi]
- Aspects of Reversibility for Classical AutomataMartin Kutrib. 83-98 [doi]
- A Weakly Universal Cellular Automaton in the Pentagrid with Five StatesMaurice Margenstern. 99-113 [doi]
- Minimum and non-Minimum Time Solutions to the Firing Squad Synchronization ProblemMargherita Napoli, Mimmo Parente. 114-128 [doi]
- Time-Optimum Smaller-State Synchronizers for Cellular AutomataHiroshi Umeo. 129-145 [doi]
- Computing Boolean Functions via Quantum HashingFarid M. Ablayev, Alexander Vasiliev. 149-160 [doi]
- Complexity of Promise Problems on Classical and Quantum AutomataMaria Paola Bianchi, Carlo Mereghetti, Beatrice Palano. 161-175 [doi]
- Quantum Complexity of Boolean Matrix Multiplication and Related ProblemsFrançois Le Gall. 176-191 [doi]
- Quantum Distributed Computing Applied to Grover's Search AlgorithmDebabrata Goswami. 192-199 [doi]
- Maximally Entangled State in Pseudo-Telepathy GamesLaura Mancinska. 200-207 [doi]
- Quantum Finite Automata: A Modern IntroductionA. C. Cem Say, Abuzer Yakaryilmaz. 208-222 [doi]
- Physical Aspects of Oracles for Randomness and Hadamard's ConjectureKarl Svozil. 223-230 [doi]
- From Quantum Query Complexity to State ComplexityShenggen Zheng, Daowen Qiu. 231-245 [doi]
- Small Universal DevicesArtiom Alhazov, Yurii Rogozhin, Sergey Verlan. 249-263 [doi]
- A Technique to Obtain Hardness Results for Randomized Online Algorithms - A SurveyHans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm. 264-276 [doi]
- Integral Difference Ratio Functions on IntegersPatrick Cégielski, Serge Grigorieff, Irène Guessarian. 277-291 [doi]
- Conditional Lindenmayer Systems with Conditions Defined by Bounded ResourcesJürgen Dassow. 292-306 [doi]
- Symmetries and Dualities in Name-Passing Process CalculiDaniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi. 307-322 [doi]
- Learning from Positive Data and Negative Counterexamples: A SurveySanjay Jain, Efim B. Kinber. 323-337 [doi]
- One-Sided Random Context Grammars: A SurveyAlexander Meduna, Petr Zemek. 338-351 [doi]
- How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory?Kenichi Morita, Tsuyoshi Ogiro. 352-366 [doi]
- On Evolutionary Approximation of Logic CircuitsLukás Sekanina, Zdenek Vasícek. 367-378 [doi]
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical SystemsMark-Oliver Stehr, Minyoung Kim, Tim McCarthy. 379-393 [doi]
- On the Limit of Some Algorithmic Approach to Circuit Lower BoundsOsamu Watanabe. 394-405 [doi]
- P Systems with Anti-MatterRudolf Freund, Gheorghe Paun. 409-420 [doi]
- A Robust Universal Flying Amorphous ComputerLukás Petru, Jirí Wiedermann. 421-435 [doi]
- Minimal Reaction Systems Defining Subset FunctionsArto Salomaa. 436-446 [doi]
- Grand Challenges of InformaticsJozef Gruska. 449-461 [doi]
- Konrad Zuse's Relationship to InformaticsRoland Vollmar. 462-471 [doi]