OPAC

検索結果一覧に戻る

Developments in Language Theory : 9th International Conference, DLT 2005, Palermo, Italy, July 4-8, 2005, Proceedings / edited by Clelia De Felice, Antonio Restivo
(Theoretical Computer Science and General Issues. ISSN:25122029 ; 3572)

データ種別	電子ブック
版	1st ed. 2005.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	2005
大きさ	XII, 412 p : online resource
著者標目	De Felice, Clelia editor Restivo, Antonio editor SpringerLink (Online service)

所蔵情報を非表示

URL	巻　次	配架場所	請求記号	登録番号	コメント	刷　年	状　態	利用注記	ISBN	予約	請求メモ
URL		射水-電子	007	EB0003858	Computer Scinece R0 2005-6,2022-3				9783540316824

書誌詳細を非表示

一般注記	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 -- Schützenberger 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???LX -- The Power of Tree Series Transducers of Type I and II -- The Inclusion Problem for Unambiguous Rational Trace Languages -- LR Parsing for Boolean Grammars -- On Some Properties of the Language of 2-Collapsing Words -- Semi-rational Sets of DAGs -- On the Frequency of Letters in Pure Binary Morphic Sequences HTTP:URL=https://doi.org/10.1007/b137735
件　名	LCSH:Machine theory LCSH:Computer science LCSH:Computer science -- Mathematics 全ての件名で検索 LCSH:Discrete mathematics FREE:Formal Languages and Automata Theory FREE:Theory of Computation FREE:Computer Science Logic and Foundations of Programming FREE:Discrete Mathematics in Computer Science
分　類	LCC:QA267-268.5 DC23:005.131
書誌ID	EB00003246
ISBN	9783540316824