Results 231 to 240 of about 3,110 (267)
Some of the next articles are maybe not open access.
On the endomorphisms of finite automata
Mathematical Systems Theory, 1970The properties of endomorphisms and automorphisms of a finite, deterministic automatonA related to the smallest input-independent partition on the set of internal states ofA are investigated. The setH d of all thed-endomorphisms ofA defined here, as well as the setG d of all thed ...
openaire +3 more sources
HYBRID EXTENDED FINITE AUTOMATA
International Journal of Foundations of Computer Science, 2006Extended finite automata are finite state automata equipped with the additional ability to apply an operation on the currently remaining input word, depending on the current state. Hybrid extended finite automata can choose from a finite set of such operations.
Henning Bordihn +2 more
openaire +2 more sources
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
Applications of Finite Automata
2002We consider three different recent applications of finite automata. They are chosen to emphasize the diversified applicapity of the theory.
openaire +1 more source
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
On the determinization of weighted finite automata
SIAM Journal on Computing, 1998Summary: We study the problem of constructing the deterministic equivalent of a nondeterministic Weighted Finite-state Automaton (WFA). Determinization of WFAs has important applications in automatic speech recognition (ASR). We provide the first polynomial-time algorithm to test for the twins property, which determines if a WFA admits a deterministic ...
Adam L. Buchsbaum +2 more
openaire +2 more sources
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
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 +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 +4 more sources
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 +2 more sources
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 +2 more sources