Abstract is missing.
- FL_0Franz Baader, Oliver Fernandez Gil, Pavlos Marantidis. 3-26 [doi]
- Logic, Languages, and Rules for Web Data Extraction and Reasoning over DataGeorg Gottlob, Christoph Koch 0001, Andreas Pieris. 27-47 [doi]
- A Stable Non-interleaving Early Operational Semantics for the Pi-CalculusThomas Troels Hildebrandt, Christian Johansen, Håkon Normann. 51-63 [doi]
- Efficient Learning of Tier-Based Strictly k-Local LanguagesAdam Jardine, Kevin McMullin. 64-76 [doi]
- The Strong, Weak, and Very Weak Finite Context and Kernel PropertiesMakoto Kanazawa, Ryo Yoshinaka. 77-88 [doi]
- N-Memory Automata over the Alphabet NBenedikt Brütsch, Patrick Landwehr, Wolfgang Thomas. 91-102 [doi]
- An Automata View to Goal-Directed MethodsLisa Hutschenreiter, Rafael Peñaloza. 103-114 [doi]
- A Calculus of Cyber-Physical SystemsRuggero Lanotte, Massimo Merro. 115-127 [doi]
- Efficient Pattern Matching in Elastic-Degenerate TextsCostas S. Iliopoulos, Ritu Kundu, Solon P. Pissis. 131-142 [doi]
- Integrated Encryption in Dynamic Arithmetic CompressionShmuel T. Klein, Dana Shapira. 143-154 [doi]
- Two-Dimensional Palindromes and Their PropertiesManasi S. Kulkarni, Kalpana Mahalingam. 155-167 [doi]
- Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular LanguagesJanusz A. Brzozowski, Corwin Sinnamon. 171-182 [doi]
- On the Complexity of Hard Enumeration ProblemsNadia Creignou, Markus Kröll, Reinhard Pichler, Sebastian Skritek, Heribert Vollmer. 183-195 [doi]
- Consensus String Problem for Multiple Regular LanguagesYo-Sub Han, Sang-Ki Ko, Timothy Ng 0001, Kai Salomaa. 196-207 [doi]
- The Weight in EnumerationJohannes Schmidt. 208-219 [doi]
- Minimization of Finite State Automata Through Partition AggregationJohanna Björklund, Loek Cleophas. 223-235 [doi]
- Derivatives and Finite Automata of Expressions in Star Normal FormHaiming Chen, Ping Lu. 236-248 [doi]
- Finding DFAs with Maximal Shortest Synchronizing Word LengthHenk Don, Hans Zantema. 249-260 [doi]
- Lower Bound Methods for the Size of Nondeterministic Finite Automata RevisitedHellis Tamm, Brink van der Merwe. 261-272 [doi]
- Linear Parsing Expression GrammarsNariyoshi Chida, Kimio Kuramitsu. 275-286 [doi]
- On Finite-Index Indexed Grammars and Their RestrictionsFlavio D'Alessandro, Oscar H. Ibarra, Ian McQuillan. 287-298 [doi]
- A Derivational Model of Discontinuous ParsingMark-Jan Nederhof, Anssi Yli-Jyrä. 299-310 [doi]
- Cut Languages in Rational BasesJirí Síma, Petr Savický. 311-322 [doi]
- Merging Relations: A Way to Compact Petri Nets' Behaviors UniformlyGiovanni Casu, G. Michele Pinna. 325-337 [doi]
- Partitioning Graphs into Induced SubgraphsDusan Knop. 338-350 [doi]
- Space Complexity of Reachability Testing in Labelled GraphsVidhya Ramaswamy, Jayalal Sarma, K. S. Sunil. 351-363 [doi]
- Most General Property-Preserving UpdatesDavide Bresolin, Ivan Lanese. 367-379 [doi]
- Over Which Monoids is the Transducer Determinization Procedure Applicable?Stefan Gerdjikov, Stoyan Mihov. 380-392 [doi]
- Color War: Cellular Automata with Majority-RuleBernd Gärtner, Ahad N. Zehmakan. 393-404 [doi]
- On the Computational Power of Affine AutomataMika Hirvensalo, Etienne Moutot, Abuzer Yakaryilmaz. 405-417 [doi]
- Detecting Useless Transitions in Pushdown AutomataDick Grune, Wan Fokkink, Evangelos Chatzikalymnios, Brinio Hond, Peter Rutgers. 421-434 [doi]
- Hardness Results for Coverability Problem of Well-Structured Pushdown SystemsChunmiao Li, Xiaojuan Cai. 435-446 [doi]
- Reachability Analysis of Pushdown Systems with an Upper StackAdrien Pommellet, Marcio Diaz, Tayssir Touili. 447-459 [doi]