scientific article; zbMATH DE number 176931

MaRDI QIDQ4036765zbMATHFDO

Authors Michael Schudy, Klaus-Jörn Lange

Publication date 18 May 1993

zbMATH Keywords

complexity theoryemptiness problemEOL systems\(L\) systemsLOGSPACE working tapetwo-way input headword problem of RPAC automata

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4085027
• Complexity of E0L structural equivalence
• Complexity of E0L structural equivalence
• Completeness results concerning systolic tree automata and E0L languages
• Decidability of structural equivalence of E0L grammars

Cited in

(4)

• Complexity of E0L structural equivalence
• Completeness results concerning systolic tree automata and E0L languages
• Complexity of E0L structural equivalence
• scientific article; zbMATH DE number 4085027 (Why is no real title available?)

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 Q4036765)