Results 251 to 260 of about 5,611,476 (304)
A color image encryption scheme utilizing a logistic-sine chaotic map and cellular automata. [PDF]
Sci RepSun S +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Communications of the ACM, 2021
Symbolic automata better balances how automata are implemented in practice.
Loris D'Antoni, Margus Veanes
openaire +1 more source
Symbolic automata better balances how automata are implemented in practice.
Loris D'Antoni, Margus Veanes
openaire +1 more source
Theory of cellular automata: A survey
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jarkko Kari
exaly +4 more sources
The Theory of Definite Automata
IEEE Transactions on Electronic Computers, 1963A definite automaton is, roughly speaking, an automaton (sequential circuit) with the property that for some fixed integer k its action depends only on the last k inputs. The notion of a definite event introduced by Kleene, as well as the related concepts of definite automata and tables, are studied here in detail. Basic results relating to the minimum
Micha A. Perles +2 more
openaire +3 more sources
Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, 2000
We summarize several recent results about hybrid automata. Our goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.
openaire +2 more sources
We summarize several recent results about hybrid automata. Our goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.
openaire +2 more sources
Theoretical Computer Science, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacek Waldmajer +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jacek Waldmajer +2 more
openaire +2 more sources
1992
We propose timed automata to model the behavior of real-time systems over time. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. A timed automaton accepts timed words — strings in which a real-valued time of occurrence is associated with each ...
Rajeev Alur, David L. Dill
openaire +2 more sources
We propose timed automata to model the behavior of real-time systems over time. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. A timed automaton accepts timed words — strings in which a real-valued time of occurrence is associated with each ...
Rajeev Alur, David L. Dill
openaire +2 more sources
The Algebraic Theory of Parikh Automata
Theory of Computing Systems, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michaël Cadilhac +2 more
openaire +3 more sources
The Theory of Automata, a Survey
1961Summary: The chapter presents a survey, which focuses that part of automaton theory that lies outside of certain sub-theories -- namely, switching theory, the theory of computability, artificial intelligence, and learning machines as well as several topics related to the statistical aspects of machines.
openaire +2 more sources