scispace - formally typeset
Search or ask a question
Topic

Continuous automaton

About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this paper , the problem of low-power assignment of the partial states of a parallel automaton is considered and a method to solve that problem is suggested that provides minimizing the number of memory elements in the implementing circuit of the automaton and minimization of their switching activity.
Abstract: The problem of a low-power assignment of the partial states of a parallel automaton is considered. A method to solve that problem is suggested that provides minimizing the number of memory elements in the implementing circuit of the automaton and minimization of their switching activity. The problem is reduced to finding a minimal weighted cover of a graph with its complete bipartite sub-graphs (bi-cliques).

1 citations

Journal Article
TL;DR: A type of reversible cellular automaton is proposed, which can be used to discuss the question of irreversibility in statistical mechanics.
Abstract: A type of reversible cellular automaton is proposed, which can be used to discuss the question of irreversibility in statistical mechanics. It lives on an infinite lattice in space-time, whose nodes are points with integer coordinates, either all even or all odd, and whose edges join all pairs of nearest-neighbour nodes. The states of the edges in the immediate future of each node are related to those in its immediate past by a ‘dynamical rule’ which is deterministic and invertible. The assumed probability measure makes the nodes at time 0 independent, and correlations develop as the time variable t increases because of the dynamical rule. Two types of entropy are defined: one, analogous to the Gibbs entropy in statistical mechanics, is shown to be independent of t, while the other, analogous to Boltzmann entropy in statistical mechanics, can change with t and is shown to increase in the sense that it is minimal at t = 0.

1 citations

Posted Content
01 Jul 2017-viXra
TL;DR: In this paper, a cellular automaton molecular model based on the classical wave equation was proposed as an alternative to cellular automata-based QM. This is a fresh approach started by some authors including Prof. Gerard ‘t Hooft.
Abstract: In a recent paper, it has been argued that QM can arise from classical cellular automata. This is a fresh approach started by some authors including Prof. Gerard ‘t Hooft. Nonetheless, in a previous paper, we have reviewed some inadequacies of Schrodinger equation, hence the entire wave mechanics. According to Shpenkov, the classical wave equation is able to derive a periodic table of elements -which is close to Mendeleyev’s periodic table-, and also other phenomena related to the structure of molecules. It is suggested that Shpenkov’s interpretation of classical wave equation can complement Schrodinger equation. Therefore in this paper we will discuss how we can arrive to a cellular automaton molecular model starting from classical wave equation, as an alternative to cellular automata based QM.

1 citations

Posted Content
TL;DR: The paper presents the differential equations that characterize an asynchronous automaton and gives their solution x: R->{0,1}x...x {0, 1}.
Abstract: The paper presents the differential equations that characterize an asynchronous automaton and gives their solution x:R->{0,1}x...x{0,1}. Remarks are made on the connection between the continuous time and the discrete time of the approach. The continuous and the discrete time, the linear and the branching temporal logics have the semantics depending on x and their formulas give the properties of the automaton.

1 citations

Network Information
Related Topics (5)
Time complexity
36K papers, 879.5K citations
81% related
Graph (abstract data type)
69.9K papers, 1.2M citations
77% related
Approximation algorithm
23.9K papers, 654.3K citations
77% related
Graph theory
20.8K papers, 691.4K citations
76% related
Computational complexity theory
30.8K papers, 711.2K citations
76% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20232
202219
20212
20192
20184
201719