𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Checking Finite Traces using Alternating Automata

✍ Scribed by Bernd Finkbeiner; Henny Sipma

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
298 KB
Volume
55
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Finite-turn checking automata
Finite-turn checking automata
✍ Rani Siromoney πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 443 KB

A one-to-one correspondence is established between the class of all equal matrix languages and the class of finite-turn checking automata. This checking automaton is provided with a counter in its memory to keep track of the number of turns of the stack-head. Several closure properties of this famil

Efficient implementation of regular lang
Efficient implementation of regular languages using reversed alternating finite automata
✍ 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

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

The finite graph problem for two-way alt
The finite graph problem for two-way alternating automata
✍ MikoΕ‚aj BojaΕ„czyk πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 206 KB

Two-way alternating automata on inΓΏnite trees were introduced by Vardi (Reasoning about the part with two way

Image Representation using Distributed W
Image Representation using Distributed Weighted Finite Automata
✍ Y. Sivasubramanyam; Kamala Krithivasan πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 245 KB

Weighted finite automata (WFA) define real functions, in particular, grayness functions of graytone images. Inference algorithm that converts an arbitrary function (graytone image) into a WFA that can regenerate it is given in [7]. In this paper we define the theoretical construct of Cooperating Dis