Proceedings of the 18th International Conference on Implementation and Application of Automata
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Stavros Konstantinidis
Proceedings of the 18th International Conference on Implementation and Application of Automata
CIAA, 2013.

FLT
DBLP
Scholar
DOI
Full names Links ISxN
@proceedings{CIAA-2013,
	address       = "Halifax, Nova Scotia, Canada",
	doi           = "10.1007/978-3-642-39274-0",
	editor        = "Stavros Konstantinidis",
	isbn          = "978-3-642-39273-3",
	publisher     = "{Springer International Publishing}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the 18th International Conference on Implementation and Application of Automata}",
	volume        = 7982,
	year          = 2013,
}

Contents (31 items)

CIAA-2013-Campeanu #implementation
Cover Languages and Implementations (CC), p. 1.
CIAA-2013-Jurgensen #automaton
Automata for Codes (HJ), pp. 2–15.
CIAA-2013-Veanes #automaton #finite
Applications of Symbolic Finite Automata (MV), pp. 16–23.
CIAA-2013-AbbadL
Computing Weights (HA, ÉL), pp. 24–35.
CIAA-2013-BalkanskiBKW #word
Partial Word DFAs (EB, FBS, MK, BJW), pp. 36–47.
CIAA-2013-BelliB #testing #using
Using Regular Grammars for Event-Based Testing (FB, MB), pp. 48–59.
CIAA-2013-GrathwohlHNR #parsing #regular expression
Two-Pass Greedy Regular Expression Parsing (NBBG, FH, LN, UTR), pp. 60–71.
CIAA-2013-BrzozowskiL #complexity
Universal Witnesses for State Complexity of Basic Operations Combined with Reversal (JAB, DL), pp. 72–83.
CIAA-2013-CaralpRT #automaton
Trimming Visibly Pushdown Automata (MC, PAR, JMT), pp. 84–96.
CIAA-2013-ChistikovM #theorem #word
A Uniformization Theorem for Nested Word to Word Transductions (DVC, RM), pp. 97–108.
CIAA-2013-DeganoFM #model checking #towards
Towards Nominal Context-Free Model-Checking (PD, GLF, GM), pp. 109–121.
CIAA-2013-DemailleDLS #concept #implementation
Implementation Concepts in Vaucanson 2 (AD, ADL, SL, JS), pp. 122–133.
CIAA-2013-GenetGLM #algorithm #automaton
A Completion Algorithm for Lattice Tree Automata (TG, TLG, AL, VM), pp. 134–145.
CIAA-2013-HanKS #approximate #automaton #context-free grammar #finite
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (YSH, SKK, KS), pp. 146–157.
CIAA-2013-HasanIRS #automaton #on the #sequence
On Palindromic Sequence Automata and Applications (MMH, ASMSI, MSR, AS), pp. 158–168.
CIAA-2013-HenryS #equivalence #testing
LALBLC A Program Testing the Equivalence of dpda’s (PH, GS), pp. 169–180.
CIAA-2013-HolzerJ #algorithm #robust
Brzozowski’s Minimization Algorithm — More Robust than Expected — (MH, SJ), pp. 181–192.
CIAA-2013-IbarraR #problem
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages (OHI, BR), pp. 193–207.
CIAA-2013-JirasekJ #bound #on the #regular expression
On the Boundary of Regular Languages (JJ, GJ), pp. 208–219.
CIAA-2013-KushikY #finite #nondeterminism #on the #sequence #state machine
On the Length of Homing Sequences for Nondeterministic Finite State Machines (NK, NY), pp. 220–231.
CIAA-2013-KutribMMPW #automaton #decidability #finite #queue
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties (MK, AM, CM, BP, MW), pp. 232–243.
CIAA-2013-Maletti #automaton
Hyper-optimization for Deterministic Tree Automata (AM), pp. 244–255.
CIAA-2013-MrazO #automaton #decidability
λ-Confluence Is Undecidable for Clearing Restarting Automata (FM, FO), pp. 256–267.
CIAA-2013-PrusaMO #2d #automaton
Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata (DP, FM, FO), pp. 268–279.
CIAA-2013-Crespi-ReghizziP #parallel
Deterministic Counter Machines and Parallel Matching Computations (SCR, PSP), pp. 280–291.
CIAA-2013-DebarbieuxGNSZ #automaton #query #word #xml #xpath
Early Nested Word Automata for XPath Query Answering on XML Streams (DD, OG, JN, TS, MZ), pp. 292–305.
CIAA-2013-Sutner #coordination #transducer
Invertible Transducers, Iteration and Coordinates (KS), pp. 306–318.
CIAA-2013-INIBT #automaton #taxonomy
Compressed Automata for Dictionary Matching (TI, TN, SI, HB, MT), pp. 319–330.
CIAA-2013-DreyfusHK #analysis #approximate #reachability
Enhancing Approximations for Regular Reachability Analysis (AD, PCH, OK), pp. 331–339.
CIAA-2013-KisielewiczS #automaton #generative
Generating Small Automata and the Černý Conjecture (AK, MS), pp. 340–348.
CIAA-2013-MaiaMR #complexity #finite
Incomplete Transition Complexity of Basic Operations on Finite Languages (EM, NM, RR), pp. 349–356.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.