Lecture Notes in Computer Science - Machines, Computations, and Universality
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540421214, 9783540451327

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Computing with Membranes (P Systems): Universality Results

Lecture Notes in Computer Science - Machines, Computations, and Universality ◽

10.1007/3-540-45132-3_5 ◽

2001 ◽

pp. 82-101 ◽

Cited By ~ 7

Author(s):

Carlos Martín-Vide ◽

Gheorghe PĂun

Keyword(s):

P Systems

Download Full-text

JC-Nets

Lecture Notes in Computer Science - Machines, Computations, and Universality ◽

10.1007/3-540-45132-3_12 ◽

2001 ◽

pp. 190-201

Author(s):

Gabriel Ciobanu ◽

Mihai Rotaru

Download Full-text

A Simple Universal Logic Element and Cellular Automata for Reversible Computing

Lecture Notes in Computer Science - Machines, Computations, and Universality ◽

10.1007/3-540-45132-3_6 ◽

2001 ◽

pp. 102-113 ◽

Cited By ~ 47

Author(s):

Kenichi Morita

Keyword(s):

Cellular Automata ◽

Logic Element ◽

Universal Logic ◽

Reversible Computing

Download Full-text

On a Conjecture of Kůrka. A Turing Machine with No Periodic Configurations

Lecture Notes in Computer Science - Machines, Computations, and Universality ◽

10.1007/3-540-45132-3_10 ◽

2001 ◽

pp. 165-176

Author(s):

Vincent D. Blondel ◽

Julien Cassaigne ◽

Codrin Nichitiu

Keyword(s):

Turing Machine

Download Full-text

Two Normal Forms for Rewriting P Systems

Lecture Notes in Computer Science - Machines, Computations, and Universality ◽

10.1007/3-540-45132-3_9 ◽

2001 ◽

pp. 153-164 ◽

Cited By ~ 9

Author(s):

Claudio Zandron ◽

Claudio Ferretti ◽

Giancarlo Mauri

Keyword(s):

Normal Forms ◽

P Systems

Download Full-text

A Direct Construction of a Universal Extended H System

Lecture Notes in Computer Science - Machines, Computations, and Universality ◽

10.1007/3-540-45132-3_15 ◽

2001 ◽

pp. 226-239

Author(s):

Pierluigi Frisco

Keyword(s):

Direct Construction

Download Full-text

On the Computational Power of a Continuous-space Optical Model of Computation

Lecture Notes in Computer Science - Machines, Computations, and Universality ◽

10.1007/3-540-45132-3_20 ◽

2001 ◽

pp. 288-299 ◽

Cited By ~ 14

Author(s):

Thomas J. Naughton ◽

Damien Woods

Keyword(s):

Optical Model ◽

Computational Power ◽

Continuous Space ◽

Model Of Computation

Download Full-text

On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)

Lecture Notes in Computer Science - Machines, Computations, and Universality ◽

10.1007/3-540-45132-3_21 ◽

2001 ◽

pp. 300-307

Author(s):

Zenon Sadowski

Keyword(s):

Proof System ◽

Boolean Formulas

Download Full-text

On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars

Lecture Notes in Computer Science - Machines, Computations, and Universality ◽

10.1007/3-540-45132-3_14 ◽

2001 ◽

pp. 214-225 ◽

Cited By ~ 36

Author(s):

Rudolf Freund ◽

Gheorghe Păun

Download Full-text

Some Applications of the Decidability of DPDA’s Equivalence

Lecture Notes in Computer Science - Machines, Computations, and Universality ◽

10.1007/3-540-45132-3_7 ◽

2001 ◽

pp. 114-132 ◽

Cited By ~ 2

Author(s):

Géraud Sénizergues

Download Full-text

Lecture Notes in Computer Science - Machines, Computations, and UniversalityLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Computing with Membranes (P Systems): Universality Results

JC-Nets

A Simple Universal Logic Element and Cellular Automata for Reversible Computing

On a Conjecture of Kůrka. A Turing Machine with No Periodic Configurations

Two Normal Forms for Rewriting P Systems

A Direct Construction of a Universal Extended H System

On the Computational Power of a Continuous-space Optical Model of Computation

On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT)

On the Number of Non-Terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars

Some Applications of the Decidability of DPDA’s Equivalence

Lecture Notes in Computer Science - Machines, Computations, and Universality
Latest Publications