| 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 and LNBI, 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.) |
| Restricted Towers of Hanoi and Morphisms Collapsing Words: A Progress Report Locally Consistent Parsing and Applications to Approximate String Comparisons Central Sturmian Words: Recent Developments Reversible Cellular Automata Inexpressibility Results for Regular Languages in Nonregular Settings Complexity of Quantum Uniform and Nonuniform Automata Membership and Finiteness Problems for Rational Sets of Regular Languages Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells The Mortality Threshold for Partially Monotonic Automata Sturmian Words: Dynamical Systems and Derivated Words Schiitzenberger and Eilenberg Theorems for Words on Linear Orderings On the Membership of Invertible Diagonal Matrices A Kleene Theorem for Languages of Words Indexed by Linear Orderings Revolving-Input Finite Automata Some New Results on Palindromic Factors of Billiard Words A Note on a Result of Daurat and Nivat Palindromes in Sturmian Words Voronoi Cells of Beta-Integers Languages with Mismatches and an Application to Approximate Indexing. Bidimensional Sturmian Sequences and Substitutions Unambiguous Morphic Images of Strings Complementing Two-Way Finite Automata On Timed Automata with Discrete Time Structural and Language Theoretical Characterization Monotone Deterministic RL-Automata Don't Need Auxiliary Symbols On Hairpin-Free Words and Languages Adding Monotonic Counters to Automata and Transition Graphs Polynomial Generators of Recursively Enumerable Languages On Language Inequalities XK C= LX The Power of Tree Series Transducers of Type I and II …… Author Index |
内容加载中，请稍后...
商品评论（0条）