Amazon cover image
Image from Amazon.com

Implementation and application of automata : 13th international conference, CIAA 2008, San Francisco, California, USA, July 21-24, 2008 : proceedings / Oscar H. Ibarra, Bala Ravikumar (eds.).

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 5148. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publication details: Berlin ; New York : Springer, ©2008.Description: 1 online resource (xiii, 287 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540708445
  • 3540708448
  • 9783540708438
  • 354070843X
Other title:
  • CIAA 2008
  • 13th international conference, CIAA 2008
Subject(s): Genre/Form: Additional physical formats: Print version:: Implementation and application of automata.DDC classification:
  • 511.3 22
LOC classification:
  • QA267 .C5247 2008eb
Online resources:
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.
Summary: Annotation 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 together 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references and author index.

Print version record.

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

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.

Powered by Koha