最 低 价：￥488.16
定 价：￥542.40
作 者：MichaelDomaratzki 著 著
出 版 社：Oversea Publishing House
出版时间：2005-3-1
I S B N：9783540243182
| 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 sub series 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.） |
| Invited Papers Automata-Theoretic Techniques for Analyzing Infinite-Systems Oscar H.Ibarra Enumerating Regular Expressions and Their Languages Contributed Papers A General Weighted Grammar Library On the Complexity of Hopcrof's State Minimization Algoritm Implem entation of Catalytic P Systems Code Selection by Tree Series Transducers Some Non-Semi-decidability Problems for Linear and Deterministic Context-Free Languages Brute force Determinization of NFAS by Means of State Covers Computing the Follow Automaton of an Expression Viral Gene Compression: Complexity and Verification Concatenation State Machines and Simple Functions FIRE Station:An Environment for Manipulating Finite Automata and Regular Expression Views Finding Finite Automata That Certify Termination of String Rewriting Linear Encoding Scheme for Weighted Finite Automata The Generalization of Generalized Automata:Expression Automata An Automata Approach to Match Gapped Sequence Tags Against Protein Database State Complexity of Concatenation and Complementation of Regular Languages Minimal Unambiguous NFA Substitutions ,Trajectories and Noisy Channels State Complexity and the Monoid of Transformations of a Finite Set An Application of Quantum Finite Automata to Interactive Proof Systems Time and Space Efficient Algorithms for Constrained Sequence Alignment Stochastic Context-Free Graph Grammars for Glycoprotein Modelling Parametric Weighted Finite Automata for Figure Drawing Regional Finite-State Error Repair …… Poster Papers Author Index |
内容加载中，请稍后...
商品评论（0条）