scientific article; zbMATH DE number 3649989

MaRDI QIDQ3208085zbMATH OpenFDO

Authors Andreas Brandstädt

Publication date 1978

zbMATH Keywords

context-free languagesregular languagescrossing complexityone-tape on-line Turing-machinesrecognition and generation of languagesreturn and dual return complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3208085)