✦ LIBER ✦

On finite automata with limited nondeterminism

✍ Scribed by Hing Leung

Book ID: 105931065
Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 320 KB
Volume: 35
Category: Article
ISSN: 0001-5903
DOI: 10.1007/s002360050133

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Amounts of nondeterminism in finite auto

Amounts of nondeterminism in finite automata

✍ Chandra M. R. Kintala; Detlef Wotschke 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 282 KB

Communication Complexity Method for Meas

Communication Complexity Method for Measuring Nondeterminism in Finite Automata

✍ Juraj Hromkovič; Sebastian Seibert; Juhani Karhumäki; Hartmut Klauck; Georg Schn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Experiments with finite moore automata

✍ Yu. M. Borodyanskii 📂 Article 📅 1965 🏛 Springer US 🌐 English ⚖ 790 KB

Repeated Games with Finite Automata

✍ Elchanan Ben-Porath 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 571 KB

Limitedness theorem on finite automata w

Limitedness theorem on finite automata with distance functions

✍ K. Hashiguchi 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 664 KB

On Limited Nondeterminism and the Comple

On Limited Nondeterminism and the Complexity of the V-C Dimension

✍ Christos H. Papadimitriou; Mihalis Yannakakis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 439 KB

We characterize precisely the complexity of several natural computational problems in NP, which have been proposed but not categorized satisfactorily in the literature: Computing the Vapnik Chervonenkis dimension of a 0 1 matrix; finding the minimum dominating set of a tournament; satisfying a Boole