scientific article

zbMATH Open0769.68064MaRDI QIDQ4036765FDOQ4036765

Klaus-Jörn Lange, Michael Schudy

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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)

Cited In (3)

• Complexity of EOL structural equivalence
• Complexity of E0L structural equivalence
• Completeness results concerning systolic tree automata and E0L languages

   Recommendations

• Title not available (Why is that?) 👍 👎
• Complexity of E0L structural equivalence 👍 👎
• Complexity of EOL structural equivalence 👍 👎
• Completeness results concerning systolic tree automata and E0L languages 👍 👎
• Decidability of structural equivalence of E0L grammars 👍 👎

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)