7,009 Hits in 4.9 sec

Adding Monotonic Counters to Automata and Transition Graphs [chapter]

Wong Karianto
2005 Lecture Notes in Computer Science  
We show that, for linearbounded automata, this extension does not increase the language recognition power.  ...  We analyze models of infinite-state automata extended by monotonic counting mechanisms, starting from the (finite-state) Parikh automata studied by Klaedtke and Rueß.  ...  Introduction The idea of counting devices is a classical one in automata theory.  ... 
doi:10.1007/11505877_27 fatcat:vj4uyqzbf5fnvak6i2ijsfulmq

Page 1316 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
In this large work the author concentrates on various aspects of artificial life in the framework of reversible cellular automata (RCA).  ...  The pushdown cellular automata are a stack augmented generalization of classical cellular automata.  ... 

Remarks on the structure of Clifford quantum cellular automata [article]

Dirk-Michael Schlingemann
2008 arXiv   pre-print
We report here on the structure of reversible quantum cellular automata with the additional restriction that these are also Clifford operations.  ...  This means that tensor products of Weyl operators (projective representation of a finite abelian symplectic group) are mapped to multiples of tensor products of Weyl operators.  ...  2008 The general concept In order to motivate the concept for "quantum" cellular automata, we briefly review here the idea of reversible classical cellular automata from an algebraic point of view.  ... 
arXiv:0812.0714v1 fatcat:choo33d77vcj5px5khikpiua5i

Automata with modulo counters and nondeterministic counter bounds

Daniel Reidenbach, Markus L. Schmid
2014 Kybernetika (Praha)  
We introduce and investigate Nondeterministically Bounded Modulo Counter Automata (NBMCA), which are two-way one-head automata that comprise a constant number of modulo counters, where the counter bounds  ...  NBMCA are tailored to recognising those languages that are characterised by the existence of a specific factorisation of their words, e. g., pattern languages.  ...  Two aspects of this approach seem to be particularly worth studying.  ... 
doi:10.14736/kyb-2014-1-0066 fatcat:jlu5akepqvdijdnag5qytam4ri

Theoretical Aspects of Symbolic Automata [chapter]

Hellis Tamm, Margus Veanes
2017 Lecture Notes in Computer Science  
We show that Brzozowski's double-reversal method for minimizing classical deterministic automata as well as its generalization is applicable for symbolic automata.  ...  Symbolic automata have been intensively studied recently and they have proven useful in several applications. We study some theoretical aspects of symbolic automata.  ...  We show that Brzozowski's double-reversal method for minimizing classical deterministic automata as well as its generalization is applicable for symbolic automata. Elements of Σ are characters.  ... 
doi:10.1007/978-3-319-73117-9_30 fatcat:pwpbq7huxzfzbbjbu6rb7x3agy

Page 7940 of Mathematical Reviews Vol. , Issue 98M [page]

1998 Mathematical Reviews  
The main results of the paper are the following: (1) A(T) < h(u) and hA( Ty) = A(u) for T reversible and uw € #. (2) H(T" pz) > H (yu) for any n € Z if T is reversible and uw is a Bernoulli mea- sure.  ...  In this paper the author studies some time evolution properties of entropy functions associated to the following model of d- dimensional reversible cellular automata.  ... 

The main stages of the cellular automata theory formation
Основные этапы становления теории клеточных автоматов

Victor Aladjev, International Academy of Noosphere
2022 Voprosy kiberbezopasnosti  
Finally, our standpoint is presented on the place of the problematics of cellular automata in the system of modern natural science.  ...  Paper presents our standpoint on the main stages of the cellular automata theory formation, based on our many years of research in this field.  ...  Applications of and methods  ... 
doi:10.21681/2311-3456-2022-1-10-17 fatcat:ta23v237kjeh3edc2kubu2yj7q

Quantum Conditional Strategies and Automata for Prisoners' Dilemmata under the EWL Scheme

Konstantinos Giannakis, Georgia Theocharopoulou, Christos Papalitsas, Sofia Fanarioti, Theodore Andronikos
2019 Applied Sciences  
Similarly, state machines, and specifically finite automata, have also been under constant and thorough study for plenty of reasons.  ...  Classical game theory is an important field with a long tradition of useful results.  ...  Quantum Automata for the Classical Repeated PD The classical PD game has two different actions for every player, which means that there are 2 2 possible outcomes.  ... 
doi:10.3390/app9132635 fatcat:rkqtrcjzlbeglibbenfrk43o5a

Page 5733 of Mathematical Reviews Vol. , Issue 92j [page]

1992 Mathematical Reviews  
The fact that there is a complete geometric structure, instead of isolated points, opens the possibility of using classical techniques (such as convex programming) for the design of optimal automata.  ...  The problems examined concern computational aspects of the theory; the appli- cations of cellular automata to modelling of natural phenomena are not considered.  ... 

Page 6952 of Mathematical Reviews Vol. , Issue 91M [page]

1991 Mathematical Reviews  
We identify a new line of critical points for the triangular cellular automata.  ...  On the other hand, the classical dynamics corresponding to mixed quantum states dif- fers fundamentally from the classical dynamics for pure states.  ... 

Preface of the Special Issue on Theoretical Aspects of Computer Science (2018)

Rolf Niedermeier, Brigitte Vallée
2020 Theory of Computing Systems  
The topics of the chosen papers cover a rich set of areas within Theoretical Computer Science, that is, algorithmic game theory, automata theory, circuit complexity, efficient algorithms, logic and model  ...  This special issue contains eight articles which are based on extended abstracts that were presented at the 35th Symposium on Theoretical Aspects of Computer Science (STACS), which was held at the University  ...  from the theory of finite automata.  ... 
doi:10.1007/s00224-020-09969-6 fatcat:w43zrbitbvay7i7m5hom7odvdm

Foundations of Reversible Computation [chapter]

Bogdan Aman, Gabriel Ciobanu, Robert Glück, Robin Kaarsgaard, Jarkko Kari, Martin Kutrib, Ivan Lanese, Claudio Antares Mezzina, Łukasz Mikulski, Rajagopal Nagarajan, Iain Phillips, G. Michele Pinna (+3 others)
2020 Lecture Notes in Computer Science  
Pushdown Automata Reversible classical pushdown automata have been introduced in [107] .  ...  The closure properties of reversible real-time queue automata are similar as for reversible deterministic pushdown automata.  ... 
doi:10.1007/978-3-030-47361-7_1 fatcat:3qgnwqrqnvdltkqjbuzfgx7wty

Finite automata models of quantized systems: conceptual status and outlook [article]

Karl Svozil
2002 arXiv   pre-print
We review automaton complementarity, reversible automata and the connections to generalized urn models.  ...  Since Edward Moore, finite automata theory has been inspired by physics, in particular by quantum complementarity.  ...  A corresponding Mealy automaton is {1, 2, 3, 4}, Another potential application is the investigation of the "intrinsic physical properties" of virtual realities in general, and computer games in particular  ... 
arXiv:quant-ph/0209089v1 fatcat:h4imum7rrbdprmjue3mh5r4d2i

First International Conference on Unconventional Models of Computation UMC'98. An Unconventional Review [article]

Karl Svozil
1998 arXiv   pre-print
Review of the First International Conference on Unconventional Models of Computation UMC'98, Auckland, New Zealand, 5-9 January, 1998  ...  In still another variation of the reversibility topic, the author of this article constructed reversible finite automata via permutation matrices.  ...  There is one immediate algorithmic aspect of reversibility. If reversible computation is just a rephrasing, a permutation of the input, then what use it anyway?  ... 
arXiv:quant-ph/9801060v1 fatcat:tdnjyqmb2ja6xn7meyck7jbn5y

Reversibility and quantum coherence in one-dimensional quantum cellular automata

Federico Centrone, Camillo Tassi, Marco Barbieri, Alessio Serafini
2018 Physical Review A  
as the notion of reversibility in such a setting.  ...  Quantum cellular automata are important tools in understanding quantum dynamics, thanks to their simple and effective list of rules.  ...  Avalle for discussion and encouragement.  ... 
doi:10.1103/physreva.98.012105 fatcat:w5k2jlzzbbgr5hhy3lsvvbypra
« Previous Showing results 1 — 15 out of 7,009 results