✦ LIBER ✦

A note on emptiness for alternating finite automata with a one-letter alphabet

✍ Scribed by Petr Jančar; Zdeněk Sawa

Book ID: 108153531
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 118 KB
Volume: 104
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2007.06.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Three-way automata on rectangular tapes

Three-way automata on rectangular tapes over a one-letter alphabet

✍ E.B. Kinber 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 977 KB

A note on realtime one-way synchronized

A note on realtime one-way synchronized alternating one-counter automata

✍ Juraj Hromkovič; Katsushi Inoue 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 547 KB

A note on finitely ambiguous distance au

A note on finitely ambiguous distance automata

✍ Hing Leung 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 248 KB

A Note on Multi-Issue Bargaining with a

A Note on Multi-Issue Bargaining with a Finite Set of Alternatives

✍ Younghwan In 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 149 KB

A note on the space complexity of some d

A note on the space complexity of some decision problems for finite automata

✍ Tao Jiang; B. Ravikumar 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 533 KB

In this note, we establish the space complexity of decision problems (such as membership, nonemptiness and equivalence) for some finite automata. Our study includes 2-way infinite automata with a pebble.

Note on a Tukey test for ordered alterna

Note on a Tukey test for ordered alternatives

✍ Walter R. Pirie; Myles Hollander 📂 Article 📅 1975 🏛 Springer Japan 🌐 English ⚖ 152 KB