Results 281 to 290 of about 14,469 (313)
Some of the next articles are maybe not open access.
A Generalization of Finite Automata
Fundamenta Informaticae, 1987In a previous article [Bull. Acad. Pol. Sci., Sér. Sci. Math. 27, 331- 332 (1979; Zbl 0415.03026)] the author answered in the positive \textit{L. H. Landweber}'s question [see Math. Syst. Theory 3, 376-384 (1969; Zbl 0182.024)], introducing a ``natural'' notion of automata which define sets of infinite sequences of more complicated structure.
openaire +2 more sources
Residual Finite State Automata
Fundamenta Informaticae, 2001We define a new variety of Nondeterministic Finite Automata (NFA): a Residual Finite State Automaton (RFSA) is an NFA all the states of which define residual languages of the language L that it recognizes; a residual language according to a word u is the set of words v such that uv is in L. We prove that every regular language is recognized by a unique
François Denis +2 more
openaire +3 more sources
Finitely Repeated Games with Finite Automata
Mathematics of Operations Research, 1998In honor of R. J. Aumann's 65th birthday The paper studies the implications of bounding the complexity of the strategies players may select, on the set of equilibrium payoffs in repeated games. The complexity of a strategy is measured by the size of the minimal automation that can implement it.
openaire +1 more source
Acta Cybern., 1985
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Finite dP Automata versus Multi-head Finite Automata
2012We describe a connection between dP automata (distributed P automata) and non-deterministic multi-head finite automata. We introduce the concepts of agreement languages of dP automata, and the notion of a two-way dP automaton. We demonstrate how the languages of non-deterministic one-way and two-way multi-head finite automata can be obtained as the ...
Erzsébet Csuhaj-Varjú, György Vaszil
openaire +1 more source
Bull. EATCS, 1988
The minimization algorithm of a finite automata \({\mathcal A}\) is presented in \textit{J. C. A. van de Snepscheut} [Trace Theory and VLSI Design Lect. Notes Comput. Sci. 200, Springer, Berlin, etc. (1985; Zbl 0616.68001)] is formulated in terms of the operations \(\rho\) (reversal of A) and \(\pi\) (powerset construction).
openaire +1 more source
The minimization algorithm of a finite automata \({\mathcal A}\) is presented in \textit{J. C. A. van de Snepscheut} [Trace Theory and VLSI Design Lect. Notes Comput. Sci. 200, Springer, Berlin, etc. (1985; Zbl 0616.68001)] is formulated in terms of the operations \(\rho\) (reversal of A) and \(\pi\) (powerset construction).
openaire +1 more source
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 +1 more source
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 +1 more source
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 +1 more source
Extended Nondeterministic Finite Automata
Fundamenta Informaticae, 2010We consider a new expansion of nondeterministic finite automata. The goals of this consideration are: to apply some algorithms of such expansion for various problems of minimization of classical nondeterministic automata; to use such automata for describing practical anytime algorithms for the same problems of minimization; using such automata, we ...
openaire +2 more sources