Space-bounded complexity classes and iterated deterministic substitution

DOI10.1016/S0019-9958(80)90172-2zbMath0459.68017OpenAlexW2040990260MaRDI QIDQ3910001

Peter R. J. Asveld

Publication date: 1980

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(80)90172-2

zbMATH Keywords

space complexitylanguage family

Mathematics Subject Classification ID

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

Related Items (3)

Abstract grammars based on transductions ⋮ Time and space complexity of inside-out macro languages ⋮ Hierarchies of hyper-AFLs

This page was built for publication: Space-bounded complexity classes and iterated deterministic substitution