Results 261 to 270 of about 194,426 (295)
Some of the next articles are maybe not open access.
IEEE Transactions on Computers, 1974
By modifying the acceptability conditions in finite automata, a new and equivalent variant—the "structure automaton"— is obtained. The collection SR(Σ) of sets of tapes on Σ definable by deterministic structure-automata forms, however, a proper subset of the collection of regular sets.
openaire +1 more source
By modifying the acceptability conditions in finite automata, a new and equivalent variant—the "structure automaton"— is obtained. The collection SR(Σ) of sets of tapes on Σ definable by deterministic structure-automata forms, however, a proper subset of the collection of regular sets.
openaire +1 more source
From Tree Automata to String Automata Minimization
Theory of Computing Systems, 2017The authors associate with any given deterministic finite bottom-up tree automaton (DFTA) a deterministic finite string automaton (DFA) that can be used for minimizing the tree automaton. By this reduction the existing efficient minimization algorithms designed for string automata become applicable to tree automata.
Guellouma, Younes +3 more
openaire +1 more source
Converting Self-verifying Automata into Deterministic Automata
2009Self-verifying automata are a special variant of finite automata with a symmetric kind of nondeterminism. In this paper, we study the transformation of self-verifying automata into deterministic automata from a descriptional complexity point of view. The main result is the exact cost, in terms of the number of states, of such a simulation.
G. Jiraskova, G. Pighizzini
openaire +2 more sources
Timed Automata as a Formalism for Expressing Security: A Survey on Theory and Practice
ACM Computing Surveys, 2023Johan Arcile, Étienne André
exaly
Learning Automata-Based Multiagent Reinforcement Learning for Optimization of Cooperative Tasks
IEEE Transactions on Neural Networks and Learning Systems, 2021Zhen Zhang, Dongqing Wang, Junwei Gao
exaly