✦ LIBER ✦

Complexity classes and theories of finite models

✍ Scribed by James F. Lynch

Publisher: Springer
Year: 1981
Tongue: English
Weight: 968 KB
Volume: 15
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01786976

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Finite-state models of plot complexity

✍ Edward Kahn 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 810 KB

On tape-bounded complexity classes and m

On tape-bounded complexity classes and multihead finite automata

✍ I.H. Sudborough 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 798 KB

The principal result described in this paper is the equivalence of the following statements : (1) Every set accepted by a nondeterministic one-way two-head finite automaton can be accepted by a deterministic two-way k-head finite automaton, for some k. (2) The context-free language Lp (described i

Theories of complexity

✍ Dominique Chu; Roger Strand; Ragnar Fjelland 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

Estimation of the algorithmic complexity

Estimation of the algorithmic complexity of classes of computable models

✍ E. N. Pavlovskii 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 217 KB

Amalgamation properties and finite model

Amalgamation properties and finite models in Ln-theories

✍ John Baldwin; Olivier Lessmann 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 117 KB

Deterministic propositional dynamic logi

Deterministic propositional dynamic logic: Finite models, complexity, and completeness

✍ Mordechai Ben-Ari; Joseph Y. Halpern; Amir Pnueli 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 911 KB