Buch, Englisch, Band 5642, 263 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 423 g
14th International Conference, CIAA 2009, Sydney, Australia, July 14-17, 2009, Proceedings
Buch, Englisch, Band 5642, 263 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 423 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-642-02978-3
Verlag: Springer
The 14th International Conference on Implementation and Application of - tomata (CIAA 2009) was held in NICTA’s Neville Roach Laboratory at the University of New South Wales, Sydney, Australia during July 14–17, 2009. This volume of Lecture Notes in Computer Science contains the papers that were presented at CIAA 2009, as well as abstracts of the posters and short papers that were presented at the conference. The volume also includes papers orextendedabstractsofthethreeinvitedtalkspresentedbyGonzalo Navarro on ImplementationandApplicationofAutomatainStringProcessing,byChristoph Koch on Applications of Automata in XML Processing,and by Helmut Seidl on Program Analysis Through Finite Tree Automata. The 23 regular papers were selected from 42 submissions covering various ?elds in the application, implementation, and theory of automata and related structures. This year, six additional papers were selected as “short papers”; at the conference these were allocated the same presentation length as r- ular papers. Each paper was reviewed by at least three Program Committee members, with the assistance of external referees. Papers were submitted by - thors from the following countries: Australia, Austria, Belgium, Brazil, Canada, China, Czech Republic, Finland, France, Germany, India, Italy, Republic of - rea,Japan,Latvia,TheNetherlands,Portugal,RussianFederation,Spain,South Africa, Turkey, United Arab Emirates, and the USA.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Kybernetik, Systemtheorie, Komplexe Systeme
- Mathematik | Informatik Mathematik Mathematik Interdisziplinär Systemtheorie
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering
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?.
