𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finite-State Unification Automata and Relational Languages

✍ Scribed by Y. Shemesh; N. Francez

Book ID
112252105
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
842 KB
Volume
114
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Alternating finite automata and star-fre
Alternating finite automata and star-free languages
✍ Kai Salomaa; Sheng Yu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 96 KB

For a given extended regular expression e we construct an equational representation of an alternating ΓΏnite automaton accepting the language denoted by e. For star-free extended regular expressions the construction yields a loop-free alternating ΓΏnite automaton. Also the inclusion in the opposite di

Unification and extension of weighted fi
Unification and extension of weighted finite automata applicable to image compression
✍ Zhuhan Jiang; Olivier de Vel; Bruce Litow πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 503 KB

Weighted ΓΏnite automata (WFA), including the linear WFA due to Culik and Kari and the acyclic WFA due to Hafner, have been under investigation over the years for their applications to image compression. We shall in this work ΓΏrst examine in great details the underlying WFA structure and propose the