Results 261 to 270 of about 4,904 (291)
Quantum Collapse and Computation in an Everett Multiverse. [PDF]
Entropy (Basel)Tamburini F, Licata I.
europepmc +1 more source
Linear-Time Verification of Data-Aware Processes Modulo Theories via Covers and Automata
Alessandro Gianola +2 more
openalex +2 more sources
Task Scheduling of Multiple Humanoid Robot Manipulators by Using Symbolic Control. [PDF]
Biomimetics (Basel)Özbaltan M +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Theoretical Computer Science, 2019
Abstract In the paper, a fragment of the new theory of tailor automata is presented, within which a deterministic finite automaton was defined. The proposed automaton provides a theoretical model of an informally characterized biomolecular automaton.
Jacek Waldmajer +2 more
openaire +2 more sources
Abstract In the paper, a fragment of the new theory of tailor automata is presented, within which a deterministic finite automaton was defined. The proposed automaton provides a theoretical model of an informally characterized biomolecular automaton.
Jacek Waldmajer +2 more
openaire +2 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
E. Shamir, M. O. Rabin, M. Perles
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
An approach to a unified theory of automata
8th Annual Symposium on Switching and Automata Theory (SWAT 1967), 1967An automaton called the balloon automaton is defined. The balloon automaton comes in four varieties, depending on whether the device is deterministic or nondeterministic, and whether the input head can move in one or two directions. Subsets of the balloon automata of each variety, called closed classes are defined.
Jeffrey D. Ullman, John E. Hopcroft
openaire +4 more sources
THE ABSTRACT THEORY OF AUTOMATA
Russian Mathematical Surveys, 1961CONTENTSIntroduction § 1. Homomorphism and equivalence of automata § 2. Introduction of mappings in automata § 3. Introduction of events in finite automata, operations on events § 4. Automata and semi-groups § 5. The composition of automata § 6.
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