Results 291 to 300 of about 6,057,560 (362)
Some of the next articles are maybe not open access.
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.
T. Henzinger
openaire +3 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.
T. Henzinger
openaire +3 more sources
Unambiguity in Automata Theory
Workshop on Descriptional Complexity of Formal Systems, 2015Determinism of devices is a key aspect throughout all of computer science, simply because of considerations of efficiency of the implementation. One possible way (among others) to relax this notion is to consider unambiguous machines: non-deterministic machines that have at most one accepting run on each input.
Thomas Colcombet
openaire +2 more sources
Design and Implementation of Ludo Game Using Automata Theory
2019 Innovations in Power and Advanced Computing Technologies (i-PACT), 2019Computation and automata theory is very frequently used in the lexical analysis of compilers and programming languages, image compression, bioinformatics, morphological analysis etc., This research work proposed the design of Ludo game using automata and
Khaji Faizan Ali, V. Kalyan, K. A. Kumar
semanticscholar +1 more source
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
Automata Simulator: A mobile app to teach theory of computation
Computer Applications in Engineering Education, 2019We developed a mobile app named Automata Simulator to simulate different types of automata and used it to teach the course on theory of computation. The students used the app to design and simulate automata during the lectures.
Tuhina Singh +5 more
semanticscholar +1 more source
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