E-Book, Englisch, 263 Seiten, eBook
Maneth Implementation and Application of Automata
2009
ISBN: 978-3-642-02979-0
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009, Proceedings
E-Book, Englisch, 263 Seiten, eBook
Reihe: Theoretical Computer Science and General Issues
ISBN: 978-3-642-02979-0
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
Invited Lectures.- Implementation and Application of Automata in String Processing.- Applications of Automata in XML Processing.- Program Analysis through Finite Tree Automata.- Technical Contributions.- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton.- On Extremal Cases of Hopcroft’s Algorithm.- Compact Normal Form for Regular Languages as Xor Automata.- Cellular Automata with Sparse Communication.- A Cellular Automaton Model for Car Traffic with a Slow-to-Stop Rule.- On Parallel Implementations of Deterministic Finite Automata.- FAdo and GUItar.- A Testing Framework for Finite-State Morphology.- A Table Compression Method for Extended Aho-Corasick Automaton.- Compact Representation for Answer Sets of n-ary Regular Queries.- Recognition of a Spanning Tree of Directed Acyclic Graphs by Tree Automata.- Random Generation of Deterministic Tree (Walking) Automata.- Hedge Pattern Partial Derivative.- TAGED Approximations for Temporal Properties Model-Checking.- Verifying Parallel Programs with Dynamic Communication Structures.- Fixpoint Guided Abstraction Refinement for Alternating Automata.- Automata-Based Termination Proofs.- Implementation of State Elimination Using Heuristics.- Short Regular Expressions from Finite Automata: Empirical Results.- Small Extended Expressions for Acyclic Automata.- Quantum Queries on Permutations with a Promise.- Time-Optimal Winning Strategies for Poset Games.- Amount of Nonconstructivity in Finite Automata.- Short Papers and Poster Abstracts.- Multiflex: A Multilingual Finite-State Tool for Multi-Word Units.- Efficient Parsing Using Filtered-Popping Recursive Transition Networks.- Forest FIRE: A Taxonomy-based Toolkit of Tree Automata and Regular Tree Algorithms.- Formally Synthesising a ProtocolConverter: A Case Study.- Compiler Generator Based on Restarting Automata.- Are Statecharts Finite Automata?.
