Abstract is missing.
- Automated Synthesis of Application-Layer Connectors from Automata-Based SpecificationsMarco Autili, Paola Inverardi, Filippo Mignosi, Romina Spalazzese, Massimo Tivoli. 3-24 [doi]
- Automated Program VerificationAzadeh Farzan, Matthias Heizmann, Jochen Hoenicke, Zachary Kincaid, Andreas Podelski. 25-46 [doi]
- Hankel Matrices: From Words to Graphs (Extended Abstract)Johann A. Makowsky, Nadia Labai. 47-55 [doi]
- Complexity Classes for Membrane Systems: A SurveyGiancarlo Mauri, Alberto Leporati, Luca Manzoni, Antonio E. Porreca, Claudio Zandron. 56-69 [doi]
- The Shuffle Product: New Research DirectionsAntonio Restivo. 70-81 [doi]
- Average-Case Optimal Approximate Circular String MatchingCarl Barton, Costas S. Iliopoulos, Solon P. Pissis. 85-96 [doi]
- An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical SemiringJohanna Björklund, Frank Drewes, Niklas Zechner. 97-108 [doi]
- Construction of a de Bruijn Graph for Assembly from a Truncated Suffix TreeBastien Cazaux, Thierry Lecroq, Eric Rivals. 109-120 [doi]
- Frequent Pattern Mining with Non-overlapping InversionsDa-Jung Cho, Yo-Sub Han, Hwee Kim. 121-132 [doi]
- A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random WalkH. K. Dai, Z. Wang. 133-144 [doi]
- Building Bridges Between Sets of Partial OrdersHernán Ponce de León, Andrey Mokhov. 145-160 [doi]
- Complexity of Road Coloring with Prescribed Reset WordsVojtech Vorel, Adam Roman. 161-172 [doi]
- Logics for Unordered Trees with Data Constraints on SiblingsAdrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen. 175-187 [doi]
- Weak and Nested Class Memory AutomataConrad Cotton-Barratt, Andrzej S. Murawski, C.-H. Luke Ong. 188-199 [doi]
- Insertion Operations on Deterministic Reversal-Bounded Counter MachinesJoey Eremondi, Oscar H. Ibarra, Ian McQuillan. 200-211 [doi]
- On the Synchronizing Probability Function and the Triple Rendezvous Time - New Approaches to Černý's ConjectureFrançois Gonze, Raphaël M. Jungers. 212-223 [doi]
- On Robot Games of Degree TwoVesa Halava, Reino Niskanen, Igor Potapov. 224-236 [doi]
- Time-Bounded Reachability Problem for Recursive Timed Automata is UndecidableShankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi. 237-248 [doi]
- On Observability of Automata Networks via Computational AlgebraRui Li, Yiguang Hong. 249-262 [doi]
- Reasoning on Schemas of Formulas: An Automata-Based ApproachNicolas Peltier. 263-274 [doi]
- Derivatives for Regular Shuffle ExpressionsMartin Sulzmann, Peter Thiemann. 275-286 [doi]
- From \omega -Regular Expressions to Büchi Automata via Partial DerivativesPeter Thiemann, Martin Sulzmann. 287-298 [doi]
- Quotient of Acceptance Specifications Under Reachability ConstraintsGuillaume Verdier, Jean-Baptiste Raclet. 299-311 [doi]
- Structure and Measure of a Decidable Class of Two-dimensional CodesMarcella Anselmo, Dora Giammarresi, Maria Madonia. 315-327 [doi]
- On Torsion-Free Semigroups Generated by Invertible Reversible Mealy AutomataThibault Godin, Ines Klimann, Matthieu Picantin. 328-339 [doi]
- Coding Non-orientable LaminationsLuis-Miguel Lopez, Philippe Narbel. 340-352 [doi]
- Preset Distinguishing Sequences and Diameter of Transformation SemigroupsPavel Panteleev. 353-364 [doi]
- Hierarchy and Expansiveness in 2D Subshifts of Finite TypeCharalampos Zinoviadis. 365-377 [doi]
- On the Number of Closed Factors in a WordGolnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták. 381-390 [doi]
- Online Computation of Abelian RunsGabriele Fici, Thierry Lecroq, Arnaud Lefebvre, Élise Prieur-Gaston. 391-401 [doi]
- Coverability in Two DimensionsGuilhem Gamard, Gwénaël Richomme. 402-413 [doi]
- Equation x^iy^jx^k=u^iv^ju^k in WordsJana Hadravová, Stepan Holub. 414-423 [doi]
- Square-Free Words over Partially Commutative AlphabetsLukasz Mikulski, Marcin Piatkowski, Wojciech Rytter. 424-435 [doi]
- On the Language of Primitive Partial WordsAnanda Chandra Nayak, Kalpesh Kapoor. 436-445 [doi]
- Complexity of Regular FunctionsEric Allender, Ian Mertz. 449-460 [doi]
- A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXPKazuyuki Amano, Atsushi Saito. 461-472 [doi]
- Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational ComplexityGeorg Bachmeier, Michael Luttenberger, Maximilian Schlund. 473-485 [doi]
- A Game Characterisation of Tree-like Q-resolution SizeOlaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah. 486-498 [doi]
- Recurrence Relations, Succession Rules, and the Positivity ProblemStefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi. 499-510 [doi]
- On the Complexity of Fragments of the Modal Logic of Allen's Relations over Dense StructuresDavide Bresolin, Dario Della Monica, Angelo Montanari, Pietro Sala, Guido Sciavicco. 511-523 [doi]
- Parameterized Enumeration for Modification ProblemsNadia Creignou, Raïda Ktari, Arne Meier, Julian-Steffen Müller, Frédéric Olive, Heribert Vollmer. 524-536 [doi]
- Preimage Problems for Reaction SystemsAlberto Dennunzio, Enrico Formenti, Luca Manzoni, Antonio E. Porreca. 537-548 [doi]
- Parameterized Complexity of CTL - A Generalization of Courcelle's TheoremMartin Lück, Arne Meier, Irina Schindler. 549-560 [doi]
- Single-Pass Testing Automata for LTL Model CheckingAla-Eddine Ben Salem. 563-576 [doi]
- Compressed Data Structures for Range SearchingPhilip Bille, Inge Li Gørtz, Søren Vind. 577-586 [doi]
- Average Linear Time and Compressed Space Construction of the Burrows-Wheeler TransformAlberto Policriti, Nicola Gigante, Nicola Prezza. 587-598 [doi]
- Backward Linearised Tree Pattern MatchingJan Trávnícek, Jan Janousek, Borivoj Melichar, Loek G. Cleophas. 599-610 [doi]
- BFS-Based Symmetry Breaking Predicates for DFA IdentificationVladimir Ulyantsev, Ilya Zakirzyanov, Anatoly Shalyto. 611-622 [doi]
- Learning Conjunctive Grammars and Contextual Binary Feature GrammarsRyo Yoshinaka. 623-635 [doi]
- Recognizable Series on HypergraphsRaphaël Bailly, François Denis, Guillaume Rabusseau. 639-651 [doi]
- Towards More Precise Rewriting ApproximationsYohan Boichut, Jacques Chabin, Pierre Réty. 652-663 [doi]
- Sorting Networks: The End GameMichael Codish, Luís Cruz-Filipe, Peter Schneider-Kamp. 664-675 [doi]
- Bounding Clique-Width via Perfect GraphsKonrad Kazimierz Dabrowski, Shenwei Huang, Daniël Paulusma. 676-688 [doi]
- Order Structures for Subclasses of Generalised TracesRyszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski. 689-700 [doi]
- A Nivat Theorem for Weighted Picture Automata and Weighted MSO LogicParvaneh Babari, Manfred Droste. 703-715 [doi]
- Rational Selecting Relations and SelectorsLuc Boasson, Olivier Carton. 716-726 [doi]
- A Hierarchy of Transducing Observer SystemsPeter Leupold, Norbert Hundeshagen. 727-738 [doi]
- Sublinear DTD ValidityAntoine Ndione, Aurélien Lemay, Joachim Niehren. 739-751 [doi]