✦ LIBER ✦

R70-35 Classes of Automata and Transitive Closure

✍ Scribed by Tsichritzis, D.

Book ID: 114587750
Publisher: IEEE
Year: 1970
Tongue: English
Weight: 496 KB
Volume: C-19
Category: Article
ISSN: 0018-9340
DOI: 10.1109/t-c.1970.223063

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Transitive closure for restricted classe

Transitive closure for restricted classes of partial orders

✍ Tze-Heng Ma; Jeremy Spinrad 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 542 KB

Most papers dealing with partial orders assume that the input is given either in transitively closed or transitrvely reduced form. In this paper, we show that it is possible to solve some problems on partial orders in less time than it takes to perform transitive closure or reduction for general gra

Classes of languages and linear-bounded

Classes of languages and linear-bounded automata

✍ S.-Y. Kuroda 📂 Article 📅 1964 🏛 Elsevier Science ⚖ 859 KB

Dm-automata and classes of context-free

Dm-automata and classes of context-free languages

✍ A. B. Stavrovskii; O. Yu. Pavliv 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 520 KB

Nonacceptability criteria and closure pr

Nonacceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata

✍ E. Fachini; A. Maggiolo Schettini; G. Resta; D. Sangiorgi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 813 KB

Classes of Timed Automata and the Undeci

Classes of Timed Automata and the Undecidability of Universality

✍ Arnaldo V. Moura; Guilherme A. Pinto 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Incremental and Decremental Evaluation o

Incremental and Decremental Evaluation of Transitive Closure by First-Order Queries

✍ G.Z. Dong; J.W. Su 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 448 KB