𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Complexity of Tree Automata and Logics of Programs

✍ Scribed by Emerson, E. Allen; Jutla, Charanjit S.

Book ID
118177370
Publisher
Society for Industrial and Applied Mathematics
Year
1999
Tongue
English
Weight
519 KB
Volume
29
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Logical Complexity of Some Classes of Tr
Logical Complexity of Some Classes of Tree Languages Generated by Multiple-Tree-Automata
✍ Wojciech Buszkowski πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 515 KB

LOGICAL COMPLEXITY O F SOME CLASSES O F TREE LANGUAGES GENERATED BY MULTIPLE-TREE-AUTOMATA by WOJCIECH BUSZKOWSKI in Poznaii (Poland) 0. Introduction. Preliminary terminology and notation Multiple-tree-automata (MTAs) correspond to the kind of grammars called Lindenmayer systems with tables (cf. ROZ

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

Program schemata vs. automata for decida
Program schemata vs. automata for decidability of program logics
✍ N.V. Shilov πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 922 KB

A new technique for decidability of program logics is introduced. This technique is applied to the most expressive propositional program logic -mu-calculus. 0. Introduction We would like to present program scheme technique (PST) for decidability of program and polymodal propositional logics. This te