Stavros Konstantinidis
Post-proceedings of the 18th International Conference on Implementation and Application of Automata
CIAA-J-2013, 2015.
Contents (9 items)
- CIAA-J-2013-Konstantinidis15 #automaton #implementation
- Implementation and Application of Automata (CIAA 2013) (SK), p. 1.
- CIAA-J-2013-BalkanskiBKW15 #complexity #on the #word
- On the state complexity of partial word DFAs (EB, FBS, MK, BJW), pp. 2–12.
- CIAA-J-2013-CaralpRT15 #automaton
- Trimming visibly pushdown automata (MC, PAR, JMT), pp. 13–29.
- CIAA-J-2013-INIBT15 #automaton #taxonomy
- Compressed automata for dictionary matching (TI, TN, SI, HB, MT), pp. 30–41.
- CIAA-J-2013-JirasekJ15 #bound #on the #regular expression
- On the boundary of regular languages (JJ, GJ), pp. 42–57.
- CIAA-J-2013-KutribMMPW15 #automaton #decidability #finite #queue
- Deterministic input-driven queue automata: Finite turns, decidability, and closure properties (MK, AM, CM, BP, MW), pp. 58–71.
- CIAA-J-2013-Maletti15 #automaton
- Hyper-optimization for deterministic tree automata (AM), pp. 72–87.
- CIAA-J-2013-OttoM15 #term rewriting
- λ-confluence for context rewriting systems (FO, FM), pp. 88–99.
- CIAA-J-2013-DebarbieuxGNSZ15 #automaton #query #word #xml #xpath
- Early nested word automata for XPath query answering on XML streams (DD, OG, JN, TS, MZ), pp. 100–125.