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
  • ▸ Dmitry Berdinsky and Prohrak Kruengthomya. Nonstandard Automatic Presentations for Fundamental Groups of Torus Bundles over the Circle
  • ▸ Alexis Bes and Christian Choffrut. Deciding (R,+,<,1) in (R,+,<,Z)
  • ▸ Siddharth Bhaskar, Jane Chandlee, Adam Jardine and Christopher Oakden. Boolean Monadic Recursive Schemes as a Logical Characterization of the Subsequential Functions
  • ▸ Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino and Rosalba Zizza. Lyndon Words versus Inverse Lyndon Words: Queries on Suffixes and Bordered Words
  • ▸ Jeffery Dick, Laura Hutchinson, Robert Mercas and Daniel Reidenbach. Reducing the Ambiguity of Parikh Matrices
  • ▸ 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
  • ▸ Olivier Finkel. The Automatic Baire Property and an Effective Property of omega-Rational Functions
  • ▸ Pamela Fleischmann, Dirk Nowotka, Mitja Kulczynski and Danny Bøgsted Poulsen. On Collapsing Prefix Normal Words
  • ▸ 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
  • ▸ 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
  • ▸ 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 Moss. Simplified Parsing Expression Derivatives
  • ▸ Jean Néraud. Complete Variable-length Codes: An Excursion into Words Edit Operations
  • ▸ Alexander Okhotin and Alexey Sorokin. Cyclic Shift on Multi-component Grammars
  • ▸ Ahmet Bilal Uçan. Limited Two-way Deterministic Finite Automata with Advice
  • ▸ Tomoyuki Yamakami. Intersection and Union Hierarchies of Deterministic Context-free Languages and Pumping Lemmas
  • ▸ Hans Zantema. Complexity of Automatic Sequences