Results 271 to 280 of about 4,904 (291)
Some of the next articles are maybe not open access.
2011
1. The title “theory of automata” has become somewhat passe because the problems of interest to people working in this area have changed, and therefore the subject has split into a number of different disciplines. Each of these disciplines is called by its own name, but many of the results and techniques developed in the theory of automata have turned ...
openaire +2 more sources
1. The title “theory of automata” has become somewhat passe because the problems of interest to people working in this area have changed, and therefore the subject has split into a number of different disciplines. Each of these disciplines is called by its own name, but many of the results and techniques developed in the theory of automata have turned ...
openaire +2 more sources
Unambiguity in Automata Theory
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.
openaire +1 more source
From automata theory to brain theory
International Journal of Man-Machine Studies, 1975Although the brain modeler can gain many useful insights from such concepts of orthodox automata theory as finite automata, network complexity theory, and Turing machines, we here stress that the best neural modelling will bear little resemblance to a straight application of such techniques.
openaire +2 more sources
General theory of relational automata
Fundamenta Informaticae, 1980General theory of relational automata, including non-deterministic linear and bilinear machines, structured non-deterministic tree automata and automata in some primitive classes of algebras, is developed. Particular attention is paid to languages accepted by finite relational automata.
openaire +3 more sources
On the ergodic theory of cellular automata
Mathematical Systems Theory, 1975When properly viewed, the transition rule of a cellular automaton becomes a mapF from a set to itself. The set may be made a probability space. Sufficient conditions are given to ensure thatF be measure-preserving and ergodic. Some geometric consequences of ergodicity are noted.
openaire +3 more sources
2007
A Textbook on Automata Theory has been designed for students of computer science. Adopting a comprehensive approach to the subject, the book presents various concepts with adequate explanations. The logical and structured treatment of the subject promotes better understanding and assimilation.
P. K. Srimani, S. F. B. Nasir
openaire +2 more sources
A Textbook on Automata Theory has been designed for students of computer science. Adopting a comprehensive approach to the subject, the book presents various concepts with adequate explanations. The logical and structured treatment of the subject promotes better understanding and assimilation.
P. K. Srimani, S. F. B. Nasir
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 ...
David L. Dill, Rajeev Alur
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 ...
David L. Dill, Rajeev Alur
openaire +2 more sources
Programming and the Theory of Automata)
1959Publisher Summary This chapter discusses the programming and the theory of automata. Two different types of computing units are discussed. First, a tape consisting of an indefinite number of squares, each capable of storing a single symbol. The second type of unit is a finite control automaton with a “tape head,” that is, a finite automaton, which ...
openaire +2 more sources
1974
The aim of this chapter is to study the structural properties of automata which are mentioned in 2.9: The construction and characterization of isomorphisms, subautomata, equalizers, products, coequalizers, coproducts, image-factorizations and free automata respectively. This is already done in [33] for deterministic automata, and, similar to that case,
H.-J. Kreowski +3 more
openaire +2 more sources
The aim of this chapter is to study the structural properties of automata which are mentioned in 2.9: The construction and characterization of isomorphisms, subautomata, equalizers, products, coequalizers, coproducts, image-factorizations and free automata respectively. This is already done in [33] for deterministic automata, and, similar to that case,
H.-J. Kreowski +3 more
openaire +2 more sources