𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pictures of functions and their acceptability by automata

✍ Scribed by Akira Nakamura; Hiroakira Ono

Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
800 KB
Volume
23
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fuzzy star functions, probabilistic auto
Fuzzy star functions, probabilistic automata, and their approximation by nonprobabilistic automata
✍ A. Paz πŸ“‚ Article πŸ“… 1967 πŸ› Elsevier Science 🌐 English βš– 735 KB

Let Z\* be the set of all tapes over X and let ~b be a function ~: Z\* --~ [0, 1]. The problem of approximating such functions (which can be defined, in particular, by probabilistic automata) by nonprobabilistic automata is investigated, in several aspects.

A kleene-like characterization of langua
A kleene-like characterization of languages accepted by systolic tree automata
✍ E. Fachini; A. Monti πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 686 KB

We present a Kleen-like characterization of the class of languages accepted by systolic binary tree automata, L(SBTA). This characterization uses union, intersection, restricted concatenation, restricted concatenation closure, and finite substitution closure. The restrictions we impose on the operat

Operation-preserving functions and auton
Operation-preserving functions and autonomous factors of finite automata
✍ Jerzy W. Grzymala-Busse πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 549 KB

The relationship between the structure of autonomous finite automata and their operation-preserving functions is considered. The results imply some ideas in the study of operation-preserving functions of arbitrary finite automata, because with each finite automaton the set of its autonomous factors