Abstract is missing.
- Recent Developments in Algorithmic TeachingFrank J. Balbach, Thomas Zeugmann. 1-18 [doi]
- Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical ApplicationsBruno Courcelle. 19-22 [doi]
- Descriptional and Computational Complexity of Finite AutomataMarkus Holzer, Martin Kutrib. 23-42 [doi]
- Hypothesis Spaces for LearningSanjay Jain. 43-58 [doi]
- State Complexity of Nested Word AutomataKai Salomaa. 59-70 [doi]
- A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place OperationsParosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin. 71-82 [doi]
- Minimal Union-Free Decompositions of Regular LanguagesSergey Afonin, Denis Golomazov. 83-92 [doi]
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning TheoryYohji Akama. 93-104 [doi]
- Matching Trace Patterns with Regular PoliciesFranz Baader, Andreas Bauer 0002, Alwen Tiu. 105-116 [doi]
- Absolute Convergence of Rational Series Is Semi-decidableRaphaël Bailly, François Denis. 117-128 [doi]
- Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]Christoph Behle, Andreas Krebs, Stephanie Reifferscheid. 129-140 [doi]
- Reoptimization of Traveling Salesperson Problems: Changing Single Edge-WeightsTobias Berg, Harald Hempel. 141-151 [doi]
- Refinement and Consistency of Timed Modal SpecificationsNathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet. 152-163 [doi]
- Nondeterministic Instance Complexity and Proof Systems with AdviceOlaf Beyersdorff, Johannes Köbler, Sebastian Müller. 164-175 [doi]
- How Many Holes Can an Unbordered Partial Word Contain?Francine Blanchet-Sadri, Emily Allen, Cameron Byrum, Robert Mercas. 176-187 [doi]
- An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity AlgorithmsFrancine Blanchet-Sadri, Robert Mercas, Abraham Rashin, Elara Willett. 188-199 [doi]
- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space VisualizationBernard Boigelot, Jean-François Degbomont. 200-211 [doi]
- Larger Lower Bounds on the OBDD Complexity of Integer MultiplicationBeate Bollig. 212-223 [doi]
- Picture Languages Generated by Assembling TilesPaola Bonizzoni, Claudio Ferretti, Anthonath Roslin Sagaya Mary, Giancarlo Mauri. 224-235 [doi]
- Undecidability of Operation Problems for T0L Languages and SubclassesHenning Bordihn, Markus Holzer, Martin Kutrib. 236-246 [doi]
- Decision Problems for Convex LanguagesJanusz A. Brzozowski, Jeffrey Shallit, Zhi Xu. 247-258 [doi]
- On a Family of Morphic Images of Arnoux-Rauzy WordsMichelangelo Bucci, Alessandro De Luca. 259-266 [doi]
- Monadic Datalog Tree TransducersMatthias Büchse, Torsten Stüber. 267-278 [doi]
- On Extended Regular ExpressionsBenjamin Carle, Paliath Narendran. 279-289 [doi]
- Multi-tilde Operators and Their Glushkov AutomataPascal Caron, Jean-Marc Champarnaud, Ludovic Mignot. 290-301 [doi]
- Non-uniform Cellular AutomataGianpiero Cattaneo, Alberto Dennunzio, Enrico Formenti, Julien Provillard. 302-313 [doi]
- A Cryptosystem Based on the Composition of Reversible Cellular AutomataAdam Clarridge, Kai Salomaa. 314-325 [doi]
- Grammars Controlled by Special Petri NetsJürgen Dassow, Sherzod Turaev. 326-337 [doi]
- Nested Counters in Bit-Parallel String MatchingKimmo Fredriksson, Szymon Grabowski. 338-349 [doi]
- Bounded Delay and Concurrency for Earliest Query AnsweringOlivier Gauwin, Joachim Niehren, Sophie Tison. 350-361 [doi]
- Learning by Erasing in Dynamic Epistemic LogicNina Gierasimczuk. 362-373 [doi]
- The Fault Tolerance of NP-Hard ProblemsChristian Glaßer, Aduri Pavan, Stephen D. Travers. 374-385 [doi]
- Termination of Priority RewritingIsabelle Gnaedig. 386-397 [doi]
- State Complexity of Combined Operations for Prefix-Free Regular LanguagesYo-Sub Han, Kai Salomaa, Sheng Yu. 398-409 [doi]
- Towards a Taxonomy for ECFG and RRPG ParsingKees Hemerik. 410-421 [doi]
- Counting Parameterized Border Arrays for a Binary AlphabetTomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda. 422-433 [doi]
- Bounded Hairpin CompletionMasami Ito, Peter Leupold, Victor Mitrana. 434-445 [doi]
- Rigid Tree AutomataFlorent Jacquemard, Francis Klay, Camille Vacher. 446-457 [doi]
- Converting Self-verifying Automata into Deterministic AutomataGalina Jirásková, Giovanni Pighizzini. 458-468 [doi]
- Two Equivalent Regularizations for Tree Adjoining GrammarsAnna Kasprzik. 469-480 [doi]
- Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted MatchingAude Liefooghe, Hélène Touzet, Jean-Stéphane Varré. 481-492 [doi]
- Membership Testing: Removing Extra Stacks from Multi-stack Pushdown AutomataNutan Limaye, Meena Mahajan. 493-504 [doi]
- Automata on Gauss WordsAlexei Lisitsa, Igor Potapov, Rafiq Saleh. 505-517 [doi]
- Analysing Complexity in Classes of Unary Automatic StructuresJiamou Liu, Mia Minnes. 518-529 [doi]
- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of WordsJordi Llull-Chavarría, Oscar Valero. 530-541 [doi]
- Segmentation Charts for Czech - Relations among Segments in Complex SentencesMarkéta Lopatková, Tomás Holan. 542-553 [doi]
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context ConditionsTomás Masopust. 554-565 [doi]
- Efficiency of the Symmetry Bias in Grammar AcquisitionRyuichi Matoba, Makoto Nakamura, Satoshi Tojo. 566-577 [doi]
- A Series of Run-Rich StringsWataru Matsubara, Kazuhiko Kusano, Hideo Bannai, Ayumi Shinohara. 578-587 [doi]
- On Accepting Networks of Evolutionary Processors with at Most Two Types of NodesVictor Mitrana, Bianca Truthe. 588-600 [doi]
- The Halting Problem and Undecidability of Document Generation under Access Control for Tree UpdatesNeil Moore. 601-613 [doi]
- Prediction of Creole Emergence in Spatial Language DynamicsMakoto Nakamura, Takashi Hashimoto, Satoshi Tojo. 614-625 [doi]
- On the Average Size of Glushkov s AutomataCyril Nicaud. 626-637 [doi]
- Tiling the Plane with a Fixed Number of PolyominoesNicolas Ollinger. 638-647 [doi]
- New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and LocalityKaoru Onodera. 648-659 [doi]
- On Parallel Communicating Grammar Systems and Correctness Preserving Restarting AutomataDana Pardubská, Martin Plátek, Friedrich Otto. 660-671 [doi]
- Finitely Generated Synchronizing AutomataElena V. Pribavkina, Emanuele Rodaro. 672-683 [doi]
- Genetic Algorithm for SynchronizationAdam Roman. 684-695 [doi]
- Constructing Infinite Words of Intermediate Arithmetical ComplexityPaul V. Salimov. 696-701 [doi]
- From Gene Trees to Species Trees through a Supertree ApproachCeline Scornavacca, Vincent Berry, Vincent Ranwez. 702-714 [doi]
- A Kleene Theorem for Forest LanguagesLutz Straßburger. 715-727 [doi]
- Determinization and Expressiveness of Integer Reset Timed Automata with Silent TransitionsP. Vijay Suman, Paritosh K. Pandya. 728-739 [doi]
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the LimitSicco Verwer, Mathijs de Weerdt, Cees Witteveen. 740-751 [doi]