Accepted Papers

 

  • ▸ Kazuyuki Amano. On the Size of Depth-two Threshold Circuits for the Inner Product mod 2 Function

  • ▸ Vikraman Arvind, Frank Fuhlbrück, Johannes Koebler and Oleg Verbitsky. On the Weisfeiler-Leman Dimension of Fractional Packing

  • ▸ David Belanger, Ziyuan Gao, Sanjay Jain, Wei Li and Frank Stephan. Learnability and Positive Equivalence Relations

  • ▸ Dmitry Berdinsky and Prohrak Kruengthomya. Nonstandard Automatic Presentations for Fundamental Groups of Torus Bundles over the Circle

  • ▸ Siddharth Bhaskar, Jane Chandlee, Adam Jardine and Christopher Oakden. Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions

  • ▸ Fabian Birkmann, Stefan Milius and Henning Urbat. On Language Varieties without Boolean Operations

  • ▸ Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino and Rosalba Zizza. Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words

  • ▸ Sabine Broda, António Machiavelo, Nelma Moreira and Rogério Reis. Location Based Automata for Expressions with Shuffle

  • ▸ Sankardeep Chakraborty, Roberto Grossi, Kunihiko Sadakane and Srinivasa Rao Satti. Succinct Representations for (Non)Deterministic Finite Automata

  • ▸ Stefano Crespi Reghizzi and Pierluigi San Pietro. Homomorphic Characterization of Tree Languages Based on Comma-free Encoding

  • ▸ Jeffery Dick, Laura Hutchinson, Robert Mercas and Daniel Reidenbach. Reducing the Ambiguity of Parikh Matrices

  • ▸ Francesco Dolce, Lubomira Dvorakova and Edita Pelantova. On Balanced Sequences and Their Asymptotic Critical Exponent

  • ▸ Susanna Donatelli and Serge Haddad. Expressiveness and Conciseness of Timed Automata for the Verification of Stochastic Models

  • ▸ Riccardo Dondi, Giancarlo Mauri and Italo Zoppis. Complexity Issues of String to Graph Approximate Matching

  • ▸ Frederic Dörband, Kevin Stier and Thomas Feller. Approximated Determinisation of Weighted Tree Automata

  • ▸ Frederic Dörband, Kevin Stier and Thomas Feller. Sequentiality of Group-weighted Tree Automata

  • ▸ Valentina Dorigatti and Paolo Massazza. Partially Directed Animals with a Bounded Number of Holes

  • ▸ Ziyuan Gao, Sanjay Jain, Ji Qi, Philipp Schlicht, Frank Stephan and Jacob Tarr. Ordered Semiautomatic Rings with Applications to Geometry

  • ▸ Mehmet Utkan Gezer. Windable Heads & Recognizing NL with Constant Randomness

  • ▸ Nathan Grosshans. The Power of Programs over Monoids in J

  • ▸ Jens Oliver Gutsfeld, Markus Müller-Olm and Christian Dielitz. Temporal Logics with Language Parameters

  • ▸ Stefan Hoffmann. Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words

  • ▸ Stefan Hoffmann. State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets

  • ▸ Mamoru Ishizuka, Takahito Aoto and Munehiro Iwami. Commutative Rational Term Rewriting

  • ▸ Jing Ji and Jeffrey Heinz. Input Strictly Local Tree Transducers

  • ▸ Chris Keeler and Kai Salomaa. Alternating Finite Automata with Limited Universal Branching

  • ▸ Ondřej Klíma and Peter Kostolányi. Geometrically Closed Positive Varieties of Star-free Languages

  • ▸ Manasi S. Kulkarni, Jayalal Sarma and Janani Sundaresan. On the Computational Power of Programs over BA_2 Monoid

  • ▸ Nadia Labai, Tomer Kotek, Magdalena Ortiz and Helmut Veith. Pebble-intervals Automata and FO2 with Two Orders

  • ▸ Aaron Lye. Context-sensitive Fusion Grammars Are Universal

  • ▸ Aaron Lye. Deciding Non-emptiness of Hypergraph Languages Generated by Connection-preserving Fusion Grammars is NP-complete

  • ▸ Takayuki Miyazaki and Yasuhiko Minamide. Context-free Grammars with Lookahead

  • ▸ Hiroki Morizumi. On the Power of Nondeterministic Circuits and Co-nondeterministic Circuits

  • ▸ Aaron Moss. Simplified Parsing Expression Derivatives

  • ▸ Mikhail Mrykhin and Alexander Okhotin. On Hardest Languages for One-dimensional Cellular Automata

  • ▸ Jean Néraud. Complete Variable-length Codes: An Excursion into Words Edit Operations

  • ▸ Alexander Okhotin and Alexey Sorokin. Cyclic Shift on Multi-component Grammars

  • ▸ Julian Pape-Lange. Cadences in Grammar-compressed Strings

  • ▸ Pacôme Perrotin, Kévin Perrot and Sylvain Sené. Optimising Attractor Computation in Boolean Automata Networks

  • ▸ Semyon Petrov and Alexander Okhotin. On the Transformation of Two-way Deterministic Finite Automata to Unambiguous Finite Automata

  • ▸ Giovanni Pighizzini, Branislav Rovan and Šimon Sádovský. Usefulness of Information and Unary Languages

  • ▸ Bastien Sérée, Loig Jezequel and Didier Lime. An Algorithm for Single-source Shortest Paths Enumeration in Parameterized Weighted Graphs

  • ▸ Sarai Sheinvald and Borzoo Bonakdarpour. Finite-word Hyperlanguages

  • ▸ K. Subramani and Piotr Wojciechowski. Unit Tree-like Refutations in Horn Constraint Systems

  • ▸ Ahmet Bilal Uçan. Limited Two-way Deterministic Finite Automata with Advice

  • ▸ Frits Vaandrager, Roderick Bloem and Masoud Ebrahimi. Learning Mealy Machines with One Timer

  • ▸ Tomoyuki Yamakami. Intersection and Union Hierarchies of Deterministic Context-free Languages and Pumping Lemmas

  • ▸ Hans Zantema. Complexity of Automatic Sequences