By extracting the basic properties common to the automata appeared in existing literatures, we develop a general formulation of automata with "weights." We define a pseudoautomaton and derive from it the well-known deterministic automaton, nondeterministic automaton, probabilistic automaton, fuzzy a
β¦ LIBER β¦
Possibilities of various types of alternating automata
β Scribed by M. Ya. Alberts
- Publisher
- Springer US
- Year
- 1987
- Tongue
- English
- Weight
- 526 KB
- Volume
- 22
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Various kinds of automata with weights
β
M. Mizumoto; J. Toyoda; K. Tanaka
π
Article
π
1975
π
Elsevier Science
π
English
β 656 KB
Stochastic automata for adaptive choice
β
A. I. Pletnev
π
Article
π
1990
π
Springer US
π
English
β 739 KB
Short Stories of Various Types,
β
Freck, Laura F (editor)
π
Fiction
π
English
β 302 KB
Efficient implementation of regular lang
β
K. Salomaa; X. Wu; S. Yu
π
Article
π
2000
π
Elsevier Science
π
English
β 93 KB
Alternating ΓΏnite automata (AFA) provide a natural and succinct way to denote regular languages. We introduce a bit-wise representation of reversed AFA (r-AFA) transition functions and describe an e cient implementation method for r-AFA and their operations using this representation. Experiments hav
On the power of alternation in automata
β
Juraj HromkoviΔ
π
Article
π
1985
π
Elsevier Science
π
English
β 782 KB
Test length estimates for some types of
β
V. V. Brovarnik
π
Article
π
1990
π
Springer US
π
English
β 578 KB