Automata, Universality, Computation - Emergence, Complexity and Computation
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783319090382, 9783319090399

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Sampling a Two-Way Finite Automaton

Automata, Universality, Computation - Emergence, Complexity and Computation ◽

10.1007/978-3-319-09039-9_4 ◽

2015 ◽

pp. 103-115 ◽

Cited By ~ 3

Author(s):

Zhe Dang ◽

Oscar H. Ibarra ◽

Qin Lin

Keyword(s):

Finite Automaton

Download Full-text

Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines

Automata, Universality, Computation - Emergence, Complexity and Computation ◽

10.1007/978-3-319-09039-9_5 ◽

2015 ◽

pp. 117-126

Author(s):

Turlough Neary ◽

Damien Woods

Keyword(s):

Turing Machines

Download Full-text

Logical Theory of the Additive Monoid of Subsets of Natural Integers

Automata, Universality, Computation - Emergence, Complexity and Computation ◽

10.1007/978-3-319-09039-9_2 ◽

2015 ◽

pp. 39-74 ◽

Cited By ~ 1

Author(s):

Christian Choffrut ◽

Serge Grigorieff

Keyword(s):

Logical Theory

Download Full-text

Broadcasting Automata and Patterns on ℤ2

Automata, Universality, Computation - Emergence, Complexity and Computation ◽

10.1007/978-3-319-09039-9_14 ◽

2015 ◽

pp. 297-340 ◽

Cited By ~ 1

Author(s):

Thomas Nickson ◽

Igor Potapov

Download Full-text

Computational Models Based on Splicing

Automata, Universality, Computation - Emergence, Complexity and Computation ◽

10.1007/978-3-319-09039-9_11 ◽

2015 ◽

pp. 237-257 ◽

Cited By ~ 2

Author(s):

Yurii Rogozhin ◽

Sergey Verlan

Keyword(s):

Computational Models

Download Full-text

The Grossone Methodology Perspective on Turing Machines

Automata, Universality, Computation - Emergence, Complexity and Computation ◽

10.1007/978-3-319-09039-9_7 ◽

2015 ◽

pp. 139-169 ◽

Cited By ~ 2

Author(s):

Yaroslav D. Sergeyev ◽

Alfredo Garro

Keyword(s):

Turing Machines

Download Full-text

Constructing Reversible Turing Machines by Reversible Logic Element with Memory

Automata, Universality, Computation - Emergence, Complexity and Computation ◽

10.1007/978-3-319-09039-9_6 ◽

2015 ◽

pp. 127-138 ◽

Cited By ~ 3

Author(s):

Kenichi Morita

Keyword(s):

Reversible Logic ◽

Turing Machines ◽

Logic Element ◽

With Memory

Download Full-text

The Common Structure of the Curves Having a Same Gauss Word

Automata, Universality, Computation - Emergence, Complexity and Computation ◽

10.1007/978-3-319-09039-9_1 ◽

2015 ◽

pp. 1-37

Author(s):

Bruno Courcelle

Keyword(s):

Common Structure ◽

The Common

Download Full-text

Small P Systems Defining Non-semilinear Sets

Automata, Universality, Computation - Emergence, Complexity and Computation ◽

10.1007/978-3-319-09039-9_9 ◽

2015 ◽

pp. 183-217 ◽

Cited By ~ 2

Author(s):

Artiom Alhazov ◽

Rudolf Freund

Keyword(s):

P Systems ◽

Semilinear Sets

Download Full-text

Phyllosilicate Automata

Automata, Universality, Computation - Emergence, Complexity and Computation ◽

10.1007/978-3-319-09039-9_16 ◽

2015 ◽

pp. 353-381

Author(s):

Andrew Adamatzky

Download Full-text

Automata, Universality, Computation - Emergence, Complexity and ComputationLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Sampling a Two-Way Finite Automaton

Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines

Logical Theory of the Additive Monoid of Subsets of Natural Integers

Broadcasting Automata and Patterns on ℤ2

Computational Models Based on Splicing

The Grossone Methodology Perspective on Turing Machines

Constructing Reversible Turing Machines by Reversible Logic Element with Memory

The Common Structure of the Curves Having a Same Gauss Word

Small P Systems Defining Non-semilinear Sets

Phyllosilicate Automata

Automata, Universality, Computation - Emergence, Complexity and Computation
Latest Publications