rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Implementation and Application of Automata
    sub title: 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006. Proceedings
  name:
    name part: Ibarra, Oscar H.
    role:
      role term: editor.
  name:
    name part: Yen, Hsu-Chun.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2006
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIII, 291 p. online resource.
  table of contents: Invited Lectures -- Information Distance and Its Applications -- Theory Inspired by Gene Assembly in Ciliates -- On the State Complexity of Combined Operations -- Technical Contributions -- Path-Equivalent Removals of ?-transitions in a Genomic Weighted Finite Automaton -- Hybrid Extended Finite Automata -- Refinement of Near Random Access Video Coding with Weighted Finite Automata -- Borders and Finite Automata -- Finding Common Motifs with Gaps Using Finite Automata -- Factor Oracles -- Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice -- Tiburon: A Weighted Tree Automata Toolkit -- Around Hopcroft’s Algorithm -- Multi-tape Automata with Symbol Classes -- On the Computation of Some Standard Distances Between Probabilistic Automata -- Does o-Substitution Preserve Recognizability? -- Correctness Preservation and Complexity of Simple RL-Automata -- Bisimulation Minimization of Tree Automata -- Forgetting Automata and Unary Languages -- Structurally Unambiguous Finite Automata -- Symbolic Implementation of Alternating Automata -- On-the-Fly Branching Bisimulation Minimization for Compositional Analysis -- Finite-State Temporal Projection -- Compiling Linguistic Constraints into Finite State Automata -- Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time -- A Family of Algorithms for Non Deterministic Regular Languages Inference -- Poster Abstracts -- XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof -- A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems -- Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits -- Reachability Analysis of Procedural Programs with Affine Integer Arithmetic -- Lexical Disambiguation with Polarities and Automata -- Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression -- Tighter Packed Bit-Parallel NFA for Approximate String Matching.
  note: edited by Oscar H. Ibarra, Hsu-Chun Yen.
  subject:
    topic: Computer science
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Computer logic
  subject:
    topic: Mathematical logic
  subject:
    topic: Artificial intelligence
  subject:
    topic: Computer Science
  subject:
    topic: Artificial Intelligence (incl. Robotics)
  subject:
    topic: Computation by Abstract Devices
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Logics and Meanings of Programs
  subject:
    topic: Mathematical Logic and Formal Languages
  classification: Q334-342
  classification: TJ210.2-211.495
  classification: 006.3
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 4094
  identifier: 9783540372141
  identifier: http://dx.doi.org/10.1007/11812128
  record info:
    record creation date: 100301
    record change date: 20151204175902.0
    record identifier: 978-3-540-37214-1