✦ LIBER ✦

Complexity of some problems from the theory of automata

✍ Scribed by Jacques Stern

Book ID: 114037757
Publisher: Elsevier Science
Year: 1985
Weight: 545 KB
Volume: 66
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(85)80058-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Exact complexity of problems of incomple

Exact complexity of problems of incompletely specified automata

✍ Nadia Creignou 📂 Article 📅 1996 🏛 Springer Netherlands 🌐 English ⚖ 662 KB

The Parametrized Complexity of Some Fund

The Parametrized Complexity of Some Fundamental Problems in Coding Theory

✍ Downey, Rod G.; Fellows, Michael R.; Vardy, Alexander; Whittle, Geoff 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 502 KB

Inversion of 2D cellular automata: some

Inversion of 2D cellular automata: some complexity results

✍ B. Durand 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

Complexity of some problems concerningLs

Complexity of some problems concerningLsystems

✍ Neil D. Jones; Sven Skyum 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 960 KB

The complexity of some graph colouring p

The complexity of some graph colouring problems

✍ Keith Edwards 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 896 KB