Overview
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2055)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (22 papers)
-
Invited Lectures Notes
-
JC-Nets
-
Nonterminal Complexity of Programmed Grammars
-
On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars
-
A Direct Construction of a Universal Extended H System
-
Speeding-Up Cellular Automata by Alternations
-
Efficient Universal Pushdown Cellular Automata and Their Application to Complexity
-
Firing Squad Synchronization Problem on Bidimensional Cellular Automata with Communication Constraints
-
P Systems with Membrane Creation: Universality and Efficiency
Keywords
About this book
Editors and Affiliations
Bibliographic Information
Book Title: Machines, Computations, and Universality
Book Subtitle: Third International Conference, MCU 2001 Chisinau, Moldava, May 23-27, 2001 Proceedings
Editors: Maurice Margenstern, Yurii Rogozhin
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-45132-3
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2001
Softcover ISBN: 978-3-540-42121-4Published: 09 May 2001
eBook ISBN: 978-3-540-45132-7Published: 29 June 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 328
Topics: Theory of Computation, Computation by Abstract Devices, Algorithm Analysis and Problem Complexity, Logics and Meanings of Programs, Mathematical Logic and Formal Languages