scientific article
From MaRDI portal
Publication:3208085
zbMath0417.68030MaRDI QIDQ3208085
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
context-free languagesregular languagescrossing complexityone-tape on-line Turing-machinesrecognition and generation of languagesreturn and dual return complexity
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)
This page was built for publication:
