✦ LIBER ✦

Hierarchies of weak automata and weak monadic formulas

✍ Scribed by A.W. Mostowski

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 773 KB
Volume: 83
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90283-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Alternating automata, the weak monadic t

Alternating automata, the weak monadic theory of trees and its complexity

✍ David E. Muller; Ahmed Saoudi; Paul E. Schupp 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 882 KB

The k-weak Hierarchies: An Extension of

The k-weak Hierarchies: An Extension of the Weak Hierarchical Clustering Structure

✍ Patrice Bertrand; Melvin F. Janowitz 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 44 KB

Complexity of weak acceptance conditions

Complexity of weak acceptance conditions in tree automata

✍ Jakub Neumann; Andrzej Szepietowski; Igor Walukiewicz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 98 KB

Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong conditions that are defined in terms of states appearing infinitely often on the run. Weak conditions appear in the contex

On weak completeness and weak non-degene

On weak completeness and weak non-degeneracy of networks

✍ Mirko M. Milić; Ladislav A. Novak 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 627 KB

Weak matrix elements and the determinati

Weak matrix elements and the determination of the weak mixing angles

✍ Mark B. Wise 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 774 KB

Strengths and weaknesses of Prestel

✍ Ederyn Williams 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 880 KB