Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Machines, Computations, and Universality: Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings > On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
Machines, Computations, and Universality: Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings |
Maurice Margenstern; Yurii Rogozhin
Springer Berlin Heidelberg
Machines, Computations, and Universality: Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings
On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
Authors

Rudolf Freund; Gheorghe Păun

ARI Id

1664845185494_3755218

Access

Not Available Free

Pages

214-225

DOI

10.1007/3-540-45132-3_14

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-45132-3_14

Table of Contents of Book
Showing 1 to 20 of 24 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-VIII
Three Small Universal Turing Machines
Claudio Baiocchi
1-10
Computation in Gene Networks
Asa Ben-Hur; Hava T. Siegelmann
11-24
Power, Puzzles and Properties of Entanglement
Jozef Gruska; Hiroshi Imai
25-68
Combinatorial and Computational Problems on Finite Sets of Words
Juhani Karhumäki
69-81
Computing with Membranes (P Systems): Universality Results
Carlos Martín-Vide; Gheorghe PĂun
82-101
A Simple Universal Logic Element and Cellular Automata for Reversible Computing
Kenichi Morita
102-113
Some Applications of the Decidability of DPDA’s Equivalence
Géraud Sénizergues
114-132
The Equivalence Problem for Computational Models: Decidable and Undecidable Cases
Vladimir A. Zakharov
133-152
Two Normal Forms for Rewriting P Systems
Claudio Zandron; Claudio Ferretti; Giancarlo Mauri
153-164
On a Conjecture of Kůrka. A Turing Machine with No Periodic Configurations
Vincent D. Blondel; Julien Cassaigne; Codrin Nichitiu
165-176
On the Transition Graphs of Turing Machines
Didier Caucal
177-189
JC-Nets
Gabriel Ciobanu; Mihai Rotaru
190-201
Nonterminal Complexity of Programmed Grammars
Henning Fernau
202-213
On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
Rudolf Freund; Gheorghe Păun
214-225
A Direct Construction of a Universal Extended H System
Pierluigi Frisco
226-239
Speeding-Up Cellular Automata by Alternations
Chuzo Iwamoto; Katsuyuki Tateishi; Kenichi Morita; Katsunobu Imai
240-251
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity
Martin Kutrib
252-263
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints
Salvatore La Torre; Margherita Napoli; Mimmo Parente
264-275
P Systems with Membrane Creation: Universality and Efficiency
Madhu Mutyam; Kamala Krithivasan
276-287
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 24 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings