introduced two measures of nondeterminism for pushdown automata and showed interestingly that the second measure, which we refer to as the depth measure, yields an infinite hierarchy of language families between the deterministic context-free and general context-free languages. However, the proof gi
β¦ LIBER β¦
Amounts of nondeterminism in finite automata
β Scribed by Chandra M. R. Kintala; Detlef Wotschke
- Publisher
- Springer-Verlag
- Year
- 1980
- Tongue
- English
- Weight
- 282 KB
- Volume
- 13
- Category
- Article
- ISSN
- 0001-5903
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Measures of nondeterminism for pushdown
β
Kai Salomaa; Sheng Yu
π
Article
π
1994
π
Elsevier Science
π
English
β 652 KB
Congruences of finite automata
β
V. A. Plaksin
π
Article
π
1982
π
Springer US
π
English
β 366 KB
Representations of finite automata
β
I. S. Grunskii
π
Article
π
1985
π
Springer US
π
English
β 778 KB
Frequency computations in finite automat
β
E. B. Kinber
π
Article
π
1977
π
Springer US
π
English
β 637 KB
Representation of 2-events in finite aut
β
B. G. Mirkin
π
Article
π
1973
π
Springer US
π
English
β 220 KB
Characterizations of fuzzy finite automa
β
Daowen Qiu
π
Article
π
2004
π
Elsevier Science
π
English
β 363 KB
In this paper, we establish some important concepts in fuzzy ΓΏnite automata (FFAs) with bifuzzy property, and clarify their essential relationships. First we present a number of basic deΓΏnitions and properties in FFAs. We then deΓΏne a bifuzzy family of subautomata, bifuzzy source and successor opera