自动控制的实施与应用会议会议录 Implementation and application of automata
点此进入淘宝搜索页搜索分類: 图书,计算机/网络,人工智能,
作者： Oscar H. Ibarra著
出 版 社： 湖北辞书出版社
出版时间： 2006-12-1字数：版次： 1页数： 289印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540372134包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research，development，and education，at a high level and in both printed and electronic form.Enjoying tight cooperation with the R&D community，with numerous individuals，as well as with prestigious organizations and societies，LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS including its subseries LNAI spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields.The type of material published traditionally includes.
—proceedings （published in time for the respective conference）
—post-proceedings （consisting of thoroughly revised final full papers）
—research monographs（which may be based on outstanding PhD work，research projects，technical reports，etc.）
内容简介
This book constitutes the refereed proceedings of the 11th International Conference on Implementation and Application of Automata, CIAA 2006, held in Taipei, Taiwan, in August 2006.
The 22 revised full papers and 7 revised poster papers presented together with the extended abstracts of 3 invited lectures were carefully reviewed and selected from 76 submissions. The papers cover various topics in the theory, implementation, and applications of automata and related structures.
目录
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 c-transitions in a Genomic Weighted Finite Automaton
Hybrid Extended Finite Automata
Refinement of Near Random Access Video Coding with WeightedFinite 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 Alogorithms for Non Deterministic Regular Languages Inference
Poster Abstracts
Author Index
