Mendeley出力
Developments in Language Theory : 8th International Conference, DLT 2004, Auckland, New Zealand, December 13-17, Proceedings / edited by Cristian S. Calude, Elena Calude, Michael J. Dinneen
(Lecture Notes in Computer Science. ISSN:16113349 ; 3340)
| データ種別 | 電子ブック |
|---|---|
| 版 | 1st ed. 2005. |
| 出版者 | (Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer) |
| 出版年 | 2005 |
| 大きさ | XII, 436 p : online resource |
| 著者標目 | Calude, Cristian S editor Calude, Elena editor Dinneen, Michael J editor SpringerLink (Online service) |
書誌詳細を非表示
| 一般注記 | Invited Papers -- Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey -- Some New Directions and Questions in Parameterized Complexity -- Basic Notions of Reaction Systems -- A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms -- Algebraic and Topological Models for DNA Recombinant Processes -- Contributed Papers -- Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet -- On Competence in CD Grammar Systems -- The Dot-Depth and the Polynomial Hierarchy Correspond on the Delta Levels -- Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages -- On the Maximum Coefficients of Rational Formal Series in Commuting Variables -- On Codes Defined by Bio-operations -- Avoidable Sets and Well Quasi-Orders -- A Ciliate Bio-operation and Language Families -- Semantic Shuffle on and Deletion Along Trajectories -- Sturmian Graphs and a Conjecture of Moser -- P Systems Working in the Sequential Mode on Arrays and Strings -- Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings -- The Power of Maximal Parallelism in P Systems -- An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars -- On the Complexity of 2-Monotone Restarting Automata -- On Left-Monotone Deterministic Restarting Automata -- On the Computation Power of Finite Automata in Two-Dimensional Environments -- The Role of the Complementarity Relation in Watson-Crick Automata and Sticker Systems -- The Boolean Closure of Linear Context-Free Languages -- Context-Sensitive Decision Problems in Groups -- Decidability and Complexity in Automatic Monoids -- Relating Tree Series Transducers and Weighted Tree Automata -- An NP-Complete Fragment of LTL -- From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata -- Words Avoiding -Powers and the Thue–Morse Morphism -- On the Equivalence Problem for E-Pattern Languages Over Small Alphabets -- Complementation of Rational Sets on Countable Scattered Linear Orderings -- On the Hausdorff Measure of ?-Power Languages -- A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages -- Tissue P Systems with Minimal Symport/Antiport HTTP:URL=https://doi.org/10.1007/b103739 |
|---|---|
| 件 名 | LCSH:Mathematical logic LCSH:Machine theory LCSH:Computer science LCSH:Computer science -- Mathematics 全ての件名で検索 LCSH:Discrete mathematics FREE:Mathematical Logic and Foundations FREE:Formal Languages and Automata Theory FREE:Computer Science Logic and Foundations of Programming FREE:Theory of Computation FREE:Discrete Mathematics in Computer Science |
| 分 類 | LCC:QA8.9-10.3 DC23:511.3 |
| 書誌ID | EB00002808 |
| ISBN | 9783540305507 |
類似資料
この資料の利用統計
このページへのアクセス回数：6回
※2019年3月27日以降
全貸出数：0回
(1年以内の貸出：0回)
※2019年3月27日以降