𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Recursive-determinate abstract automata

✍ Scribed by L. P. Lisovik


Book ID
105057548
Publisher
Springer US
Year
1981
Tongue
English
Weight
593 KB
Volume
17
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Deterministic finite automata with recur
✍ Jean H. Gallier; Salvatore La Torre; Supratik Mukhopadhyay πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 127 KB

We study deterministic finite automata (DFA) with recursive calls, that is, finite sequences of component DFAs that can call each other recursively. DFAs with recursive calls are akin to recursive state machines and unrestricted hierarchic state machines. We show that they are language equivalent to

Abstract Recursive Utility
✍ P.A. Streufert πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 605 KB