Implementation and application of automata : 18th International Conference, Proceedings, CIAA 2013, Halifax, NS, Canada, July 16-19, 2013. Proceedings /
Saved in:
Corporate Authors: | ; |
---|---|
Group Author: | |
Published: |
Springer,
|
Publisher Address: | Heidelberg : |
Publication Dates: | [2013] |
Literature type: | eBook |
Language: | English |
Series: |
Lecture notes in computer science ;
7982 LNCS sublibrary. SL 1, Theoretical computer science and general issues |
Subjects: | |
Online Access: |
http://dx.doi.org/10.1007/978-3-642-39274-0 |
Item Description: |
International conference proceedings. Includes author index. |
Carrier Form: | 1 online resource (xiii, 358 pages) : illustrations (black and white) |
ISBN: |
9783642392740 (electronic bk.) 3642392741 (electronic bk.) |
Index Number: | QA267 |
CLC: |
TP301.1-532 TP24-532 |
Contents: |
Cover Languages and Implementations / Automata for Codes / Applications of Symbolic Finite Automata / Computing Weights / Partial Word DFAs / Using Regular Grammars for Event-Based Testing / Two-Pass Greedy Regular Expression Parsing / Universal Witnesses for State Complexity of Basic Operations Combined with Reversal / Trimming Visibly Pushdown Automata / Uniformization Theorem for Nested Word to Word Transductions / Towards Nominal Context-Free Model-Checking / Implementation Concepts in Vaucanson 2 / A Completion Algorithm for Lattice Tree Automata / Approximate Matching between a Context-Free Grammar and a Finite-State Automaton / On Palindromic Sequence Automata and Applications / LALBLC A Program Testing the Equivalence of dpda's / Brzozowski's Minimization Algorithm--More Robust than Expected / Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages / On the Boundary of Regular Languages / On the Length of Homing Sequences for Nondeterministic Finite State Machines / Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties / Hyper-optimization for Deterministic Tree Automata / Lambda-confluence is undeciable for clearing restarting automata / Comparing two-dimensional one-marker automata to Sgraffito automata / Deterministic counter machines and parallel matching computations / Early Nested Word Automata for XPath Query Answering on XML Streams / Invertible Transducers, Iteration and Coordinates / Compressed Automata for Dictionary Matching / Enhancing Approximations for Regular Reachability Analysis / Generating Small Automata and the Černý Conjecture / Incomplete Transition Complexity of Basic Operations on Finite Languages / |