Yo-Sub Han, Kai Salomaa
Proceedings of the 21st International Conference on Implementation and Application of Automata
CIAA, 2016.
@proceedings{CIAA-2016,
doi = "10.1007/978-3-319-40946-7",
editor = "Yo-Sub Han and Kai Salomaa",
isbn = "978-3-319-40945-0",
publisher = "{Springer}",
series = "{Lecture Notes in Computer Science}",
title = "{Proceedings of the 21st International Conference on Implementation and Application of Automata}",
volume = 9705,
year = 2016,
}
Contents (27 items)
- CIAA-2016-KhoussainovL #algebra #automaton #finite #infinity #problem
- Decision Problems for Finite Automata over Infinite Algebraic Structures (BK, JL), pp. 3–11.
- CIAA-2016-Axelsen0K #automaton #finite
- The Degree of Irreversibility in Deterministic Finite Automata (HBA, MH0, MK), pp. 15–26.
- CIAA-2016-BenschBK #stack #transducer
- Deterministic Stack Transducers (SB, JB, MK), pp. 27–38.
- CIAA-2016-Calvo-ZaragozaH #distance #edit distance #string
- Computing the Expected Edit Distance from a String to a PFA (JCZ, CdlH, JO), pp. 39–50.
- CIAA-2016-Demaille #automaton #multi
- Derived-Term Automata of Multitape Rational Expressions (AD), pp. 51–63.
- CIAA-2016-StasioMPV #algorithm #game studies #using
- Solving Parity Games Using an Automata-Based Algorithm (ADS, AM, GP, MYV), pp. 64–76.
- CIAA-2016-Esik #equation
- Ternary Equational Languages (ZÉ), pp. 77–88.
- CIAA-2016-FernauK #automaton #exponential #finite #problem
- Problems on Finite Automata and the Exponential Time Hypothesis (HF, AK), pp. 89–100.
- CIAA-2016-Fujiyoshi #algorithm #automaton #multi #problem
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (AF), pp. 101–112.
- CIAA-2016-Gluck #automaton #simulation
- A Practical Simulation Result for Two-Way Pushdown Automata (RG), pp. 113–124.
- CIAA-2016-HospodarJM #complexity #nondeterminism
- Nondeterministic Complexity of Operations on Closed and Ideal Languages (MH, GJ, PM), pp. 125–137.
- CIAA-2016-IbarraM #bound #linear #on the
- On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L (OHI, IM), pp. 138–149.
- CIAA-2016-JirasekS #algebra
- Kuratowski Algebras Generated by Prefix-Free Languages (JJJ, JS), pp. 150–162.
- CIAA-2016-KapoutsisM #logic
- A Logical Characterization of Small 2NFAs (CAK, LM), pp. 163–175.
- CIAA-2016-KisielewiczKS #automaton
- Experiments with Synchronizing Automata (AK, JK, MS), pp. 176–188.
- CIAA-2016-KonstantinidisM #implementation #transducer
- Implementation of Code Properties via Transducers (SK, CM, NM, RR), pp. 189–201.
- CIAA-2016-Lerner #automaton #on the
- On Synchronizing Automata and Uniform Distribution (EL), pp. 202–212.
- CIAA-2016-BelovsMY #approach #quantum
- Looking for Pairs that Hard to Separate: A Quantum Approach (AB, JAM, AY), pp. 213–223.
- CIAA-2016-Ng #distance #regular expression
- Prefix Distance Between Regular Languages (TN0), pp. 224–235.
- CIAA-2016-Prusa #2d #complexity #set
- Complexity of Sets of Two-Dimensional Patterns (DP), pp. 236–247.
- CIAA-2016-SekiW #complexity #self
- The Complexity of Fixed-Height Patterned Tile Self-assembly (SS, AW), pp. 248–259.
- CIAA-2016-SulzmannL #ambiguity #regular expression
- Derivative-Based Diagnosis of Regular Expression Ambiguity (MS, KZML), pp. 260–272.
- CIAA-2016-Teichmann #approximate #context-free grammar #linear
- Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages (MT), pp. 273–284.
- CIAA-2016-Thiemann #regular expression
- Derivatives for Enhanced Regular Expressions (PT0), pp. 285–297.
- CIAA-2016-WangO #automaton
- Weighted Restarting Automata as Language Acceptors (QW, FO), pp. 298–309.
- CIAA-2016-WaszczukSP #parsing #performance
- Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy (JW, AS, YP0), pp. 310–321.
- CIAA-2016-WeidemanMBW #ambiguity #automaton #backtracking #behaviour #nondeterminism #regular expression #using
- Analyzing Matching Time Behavior of Backtracking Regular Expression Matchers by Using Ambiguity of NFA (NW, BvdM, MB, BWW), pp. 322–334.
