Results 271 to 280 of about 109,516 (325)
Advances in automata theory for optimization problems involving multi-period personnel scheduling
Guillaume Ghienne
openalex +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
Additive Number Theory via Automata Theory
Theory of Computing Systems, 2019In the paper under review, the authors study several problems in additive number theory by using automata theory. In particular they use a result due to \textit{V. Bruyère} et al. [Bull. Belg. Math. Soc. - Simon Stevin 1, No. 2, 191--238 (1994; Zbl 0804.11024)] and its implementation in Mousavi's software ``Walnut''.
Aayush Rajasekaran +2 more
openaire +2 more sources
2018
Learning automaton (LA) as one of computational intelligence techniques is a stochastic model operating in the framework of the reinforcement learning. LA has been found to be a useful tool for solving many complex and real world problems where a large amount of uncertainty exists or there is no access to the whole information regarding the environment.
Alireza Rezvanian +4 more
openaire +1 more source
Learning automaton (LA) as one of computational intelligence techniques is a stochastic model operating in the framework of the reinforcement learning. LA has been found to be a useful tool for solving many complex and real world problems where a large amount of uncertainty exists or there is no access to the whole information regarding the environment.
Alireza Rezvanian +4 more
openaire +1 more source
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
Perles, M., Rabin, M. O., Shamir, E.
openaire +2 more sources
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 +1 more source
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 +1 more source
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 +1 more source
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 +1 more source
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 +2 more sources