Editors:
Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3354)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Conference series link(s): MCU: International Conference on Machines, Computations, and Universality
Conference proceedings info: MCU 2004.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsThis is a preview of subscription content, access via your institution.
Table of contents (26 papers)
-
Front Matter
-
Selected Contributions
Keywords
- Erfüllbarkeitsproblem der Aussagenlogik
- Monoid
- P systems
- algorithms
- automata
- cellular automata
- complexity
- formal language
- logic
- natural computing
- ramdomness
- theoretical computer science
- theory of computing
- turing machines
- universality
- algorithm analysis and problem complexity
Editors and Affiliations
-
IUT de Metz, LITA, Université Paul Verlaine - Metz, Metz, Cédex, France
Maurice Margenstern
Bibliographic Information
Book Title: Machines, Computations, and Universality
Book Subtitle: 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers
Editors: Maurice Margenstern
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/b106980
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2005
Softcover ISBN: 978-3-540-25261-0Published: 08 March 2005
eBook ISBN: 978-3-540-31834-7Published: 25 February 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 328
Topics: Theory of Computation, Formal Languages and Automata Theory, Computer Science Logic and Foundations of Programming, Algorithms