最 低 价：￥466.50
| 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.） |
| 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 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 Alogorithms for Non Deterministic Regular Languages Inference Poster Abstracts Author Index |
内容加载中，请稍后...
商品评论（0条）