𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Complexity of Compressed Membership Problems for Finite Automata

✍ Scribed by Jeż, Artur

Book ID
120758482
Publisher
Springer
Year
2013
Tongue
English
Weight
983 KB
Volume
55
Category
Article
ISSN
1433-0490

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.

On the Computational Complexity of Finit
On the Computational Complexity of Finite Cellular Automata
✍ K. Sutner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 932 KB

We study the computational complexity of several problems with the evolution of configurations on finite cellular automata. In many cases, the problems turn out to be complete in their respective classes. For example, the problem of deciding whether a configuration has a predecessor is shown to be N