CIAA 2016 ACCEPTED PAPERS
Accepted Papers
- Christos Kapoutsis and Lamana Mulaffer
A Logical Characterization of Small 2NFAs
- Peter Thiemann
Derivatives for Enhanced Regular Expressions
- Akim Demaille
Multitape Rational Expressions
- Timothy Ng
Prefix Distance Between Regular Languages
- Markus Teichmann
Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages
- Martin Sulzmann and Kenny Zhuo Ming Lu
Derivative-Based Diagnosis of Regular Expression Ambiguity
- Shinnosuke Seki and Andrew Winslow
The complexity of fixed-height patterned tile self-assembly
- Jorge Calvo-Zaragoza, Colin De La Higuera and Jose Oncina
Computing
the Expected Edit Distance from a String to a PFA
- Qichao Wang and Friedrich Otto
Weighted Restarting Automata as
Language Acceptors
- Henning Fernau and Andreas Krebs
Problems on Finite Automata and
the Exponential Time Hypothesis
- Emil Lerner
On Synchronizing Automata and Uniform
Distribution
- Oscar H. Ibarra and Ian McQuillan
On Bounded Semilinear Languages,
Counter Machines, and Finite-Index ET0L
- J. Andres Montoya, Alexander Belovs and Abuzer Yakaryilmaz
Looking
for the pairs that are hard to separate: A quantum approach
- Daniel Prusa
Complexity of Sets of Two-dimensional
Patterns
- Jakub Waszczuk, Agata Savary and Yannick Parmentier
Enhancing
practical TAG parsing efficiency by capturing redundancy
- Stavros Konstantinidis, Casey Meijer, Nelma Moreira and Rogerio
Reis
Implementation of Code Properties via Transducers
- Andrzej Kisielewicz, Jakub Kowalski and Marek Szykuła
Experiments
with Synchronizing Automata
- Michal Hospodar, Galina Jiraskova and Peter
Mlynárčik
Nondeterministic Compexity of Operations on Closed and
Ideal Languages
- Jozef Jirasek and Juraj Sebej
Kuratowski Algebras Generated by
Prefix-Free Languages
- Akio Fujiyoshi
A Practical Algorithm for the Uniform Membership
Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree
Automata
- Nicolaas Weideman, Brink Van Der Merwe, Martin Berglund and Bruce
Watson
Analyzing matching time behavior of backtracking regular
expression matchers by using ambiguity of NFA
- Suna Bensch, Johanna Björklund and Martin Kutrib
Deterministic
Stack Transducers
- Holger Bock Axelsen, Markus Holzer and Martin Kutrib
The Degree of
Irreversibility in Deterministic Finite Automata
- Antonio Di Stasio, Aniello Murano, Giuseppe Perelli and Moshe
Vardi
Solving Parity Games Using An Automata-Based
Algorithm
- Zoltan Esik
Ternary Equational Languages
- Robert Glück
A Practical Simulation Result for Two-Way
Pushdown Automata