UID:
almahu_9947364039102882
Umfang:
XIII, 289 p.
,
online resource.
ISBN:
9783540708445
Serie:
Lecture Notes in Computer Science, 5148
Inhalt:
This book constitutes the thoroughly refereed post-proceedings of the 13th International Conference on Implementation and Application of Automata, CIAA 2008, held in San Francisco, USA, in July 2008. The 26 revised full papers togehter with 4 invited papers were carefully reviewed and selected from 40 submissions and have gone through two rounds of reviewing and improvement. The papers cover various topics in the theory, implementation, and applications of automata and related structures.
Anmerkung:
Invited Lectures -- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity -- Language Decompositions, Primality, and Trajectory-Based Operations -- Automata, Probability, and Recursion -- Concurrency, Synchronization, and Conflicts in Petri Nets -- Technical Contributions -- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties -- Antimirov and Mosses’s Rewrite System Revisited -- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata -- Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) -- Hopcroft’s Minimization Technique: Queues or Stacks? -- Learning Regular Languages Using Nondeterministic Finite Automata -- Multi-Return Macro Tree Transducers -- Computing Convex Hulls by Automata Iteration -- A Translation from the HTML DTD into a Regular Hedge Grammar -- Tree-Series-to-Tree-Series Transformations -- Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning -- Pattern Matching in DCA Coded Text -- Five Determinisation Algorithms -- Persistent Computations of Turing Machines -- On Complexity of Two Dimensional Languages Generated by Transducers -- Games for Temporal Logics on Trees -- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata -- Composed Bisimulation for Tree Automata -- Hyper-Minimization in O(n 2) -- Deterministic Pushdown Automata and Unary Languages -- Finite Eilenberg Machines -- The Number of Runs in Sturmian Words -- 3-Way Composition of Weighted Finite-State Transducers -- Progressive Solutions to FSM Equations -- Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees -- Approximate Periods with Levenshtein Distance.
In:
Springer eBooks
Weitere Ausg.:
Printed edition: ISBN 9783540708438
Sprache:
Englisch
DOI:
10.1007/978-3-540-70844-5
URL:
http://dx.doi.org/10.1007/978-3-540-70844-5
