✦ LIBER ✦

Checking Finite Traces Using Alternating Automata

✍ Scribed by Bernd Finkbeiner; Henny Sipma

Book ID: 111582551
Publisher: Springer
Year: 2004
Tongue: English
Weight: 196 KB
Volume: 24
Category: Article
ISSN: 0925-9856
DOI: 10.1023/b:form.0000017718.28096.48

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Checking Finite Traces using Alternating

Checking Finite Traces using Alternating Automata

✍ Bernd Finkbeiner; Henny Sipma 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 298 KB

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

Bounded Model Checking with SNF, Alterna

Bounded Model Checking with SNF, Alternating Automata, and Büchi Automata

✍ Daniel Sheridan 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 339 KB

Constructions for alternating finite aut

Constructions for alternating finite automata ∗

✍ Fellah, A.; Jürgensen, H.; Yu, S. 📂 Article 📅 1990 🏛 Taylor and Francis Group 🌐 English ⚖ 550 KB

An alternating hierarchy for finite auto

An alternating hierarchy for finite automata

✍ Viliam Geffert 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 438 KB

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