您现在的位置：快乐比价网 > 图书 > 人文社科 > 其它 > 商品详情

Automata Implementation自动执行技术

分享到：

最低价：￥408.90

定价：￥693.04

作者：OliverBoldt (Editor), HelmutJürgensen (Editor)　著著

出版社：湖南文艺出版社

出版时间：2001-11-1

I S B N：3540428127

价格比较

商品详情

商品评论(0条)

Automata Implementation自动执行技术

送货上门

价格
408.90元

Automata implementation(英文原版进口)

送货上门

价格
900.00元

商品详情

编辑推荐

内容简介

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 resarch 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 publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work,research projects,technical reports,etc.)

作者简介

FA Minimisation Heuristics for a Class of Finite Languages
SEA: A Symbolic Environment for Automata Theory
Analysis of Reactive Systems with n Timers
Animation of the Generation and Computation of Finite Automata for Learning Software
Metric Lexical Analysis
State Complexity of Basic Operations on Finite Languages
Treatment of Unknown Words
Computing Entropy Maps of Finite-Automaton-Encoded Binary Images
Thompson Digraphs: A Characterization
Finite Automata Encoding Geometric Figures
Compressed Storage of Sparse Finite-State Transducers
An Extendible Regular Expression in Natural Language Processing
Compiler for Finite-State Approaches
Multiset Processing by Means of Systems of Finite State Transducers
A Structural Method for Output Compaction of Sequential Automata Implemented as Circuits
An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata
A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata
Author Index