Implementation and Applications of Automata 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Ibarra, Oscar H. (Επιμελητής έκδοσης), Ravikumar, Bala (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
• Σειρά: Lecture Notes in Computer Science, 5148
• Θέματα: Computer science.; Computer programming.; Programming languages (Electronic computers).; Computers.; Algorithms.; Computer logic.; Mathematical logic.; Computer Science.; Computation by Abstract Devices.; Programming Techniques.; Programming Languages, Compilers, Interpreters.; Algorithm Analysis and Problem Complexity.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.

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...

Πίνακας περιεχομένων:

• 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.