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

Implementation and Applications of Automata 13th International Conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008, Proceedings / edited by Oscar H. Ibarra, Bala Ravikumar.

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

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Ibarra, Oscar H. (Editor), Ravikumar, Bala (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
Edition:1st ed. 2008.
Series:Theoretical Computer Science and General Issues ; 5148
Springer eBook Collection.
Subjects:
Computers.
Computer programming.
Programming languages (Electronic computers).
Algorithms.
Computer logic.
Mathematical logic.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.

Similar Items