Results 241 to 250 of about 3,110 (267)
Some of the next articles are maybe not open access.
Supernondeterministic Finite Automata
2002We show that a simple generalization of the transition tables of nondeterministic finite automata leads to a hierarchy of succinct nondeterministic descriptions for finite automata. We show that the hierarchy corresponds to deterministic finite automata on level 0 and nondeterministic finite automata on level 1 by default, and prove that the hierarchy ...
openaire +2 more sources
2013
In general, a nondeterministic automaton or machine (for example a finite automaton, pushdown automaton or Turing machine) is called unambiguous if each input is accepted by at most one run or computation. Each deterministic automaton is obviously unambiguous.
openaire +2 more sources
In general, a nondeterministic automaton or machine (for example a finite automaton, pushdown automaton or Turing machine) is called unambiguous if each input is accepted by at most one run or computation. Each deterministic automaton is obviously unambiguous.
openaire +2 more sources
Bull. EATCS, 1988
After the presentation of some notions and terminology which give an alternative and simple characterisation of minimal deterministic finite automata (abbr:dfa) it is shown that the derivation closure of a finite family of regular languages \({\mathfrak L}\) constitutes the set of states of a minimal dfa which accepts \({\mathfrak L}\). The benefits of
openaire +2 more sources
After the presentation of some notions and terminology which give an alternative and simple characterisation of minimal deterministic finite automata (abbr:dfa) it is shown that the derivation closure of a finite family of regular languages \({\mathfrak L}\) constitutes the set of states of a minimal dfa which accepts \({\mathfrak L}\). The benefits of
openaire +2 more sources
Finite automata theory with membership values in lattices
Information Sciences, 2011Yongming Li
exaly
Constructions for alternating finite automata∗
International Journal of Computer Mathematics, 1990H Jürgensen
exaly
Descriptional and computational complexity of finite automata—A survey
Information and Computation, 2011Martin Kutrib, Markus Holzer
exaly
Synchronizing finite automata on Eulerian digraphs
Theoretical Computer Science, 2003Jarkko Kari
exaly
Matrix expression and reachability analysis of finite automata
Journal of Control Theory and Applications, 2012Xiangru Xu
exaly