scientific article; zbMATH DE number 6257039

zbMath1310.68136arXiv1208.2755MaRDI QIDQ5747095

Giovanni Pighizzini

Publication date: 11 February 2014

Full work available at URL: https://arxiv.org/abs/1208.2755

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitydescriptional complexityspace complexitytwo-way automataSakoda and Sipper conjecture

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (8)

Regular language representations in the constructive type theory of Coq ⋮ Once-Marking and Always-Marking 1-Limited Automata ⋮ Two-way representations and weighted automata ⋮ On Hadamard Series and Rotating Q-Automata ⋮ From Hadamard expressions to weighted rotating automata and back ⋮ From Hadamard expressions to weighted rotating automata and back ⋮ Two-Way Automata in Coq ⋮ Converting nondeterministic two-way automata into small deterministic linear-time machines

This page was built for publication: