scientific article
From MaRDI portal
Publication:3976039
zbMath0762.68019MaRDI QIDQ3976039
Jānis Kaņeps, Rūsiņš Freivalds
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Hartmanis-Stearns Conjecture on Real Time and Transcendence ⋮ Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines ⋮ Complexity of probabilistic versus deterministic automata ⋮ Automaticity. II: Descriptional complexity in the unary case ⋮ Lower space bounds for randomized computation ⋮ Lower time bounds for randomized computation ⋮ Automaticity. IV: Sequences, sets, and diversity ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ Minimal cover-automata for finite languages ⋮ Uncountable classical and quantum complexity classes ⋮ Theory of one-tape linear-time Turing machines
This page was built for publication:
