✦ LIBER ✦

State complexity of operations on two-way finite automata over a unary alphabet

✍ Scribed by Michal Kunc; Alexander Okhotin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-State Mealy Automata of Intermediate

✍ I. I. Reznikov; V. I. Sushchanskii 📂 Article 📅 2002 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 212 KB

[Lecture Notes in Computer Science] Auto

✍ Boldt, Oliver; Jürgensen, Helmut 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 241 KB

The LBA-problem and the deterministic ta

✍ Burkhard Monien 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 483 KB

Tape complexity of languages which are r

✍ A. S. Barashko 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 525 KB

On the Bounds for State-Set Size in the

✍ Moore, F.R. 📂 Article 📅 1971 🏛 IEEE 🌐 English ⚖ 949 KB