scientific article; zbMATH DE number 777280

MaRDI QIDQ4840153zbMATH OpenFDO

Authors Ismo Hakala

Publication date 20 July 1995

zbMATH Keywords

context-free languagedecidabilityequivalence problemregular languagestime complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 176145
• Efficient algorithms for morphisms over omega-regular languages
• scientific article; zbMATH DE number 512865
• Noneffective regularity of equality languages and bounded delay morphisms
• scientific article; zbMATH DE number 3990879

Cited in

(10)

• Inverse morphic equivalence on languages
• Efficient algorithms for membership in Boolean hierarchies of regular languages
• scientific article; zbMATH DE number 4155910 (Why is no real title available?)
• scientific article; zbMATH DE number 3990879 (Why is no real title available?)
• scientific article; zbMATH DE number 512865 (Why is no real title available?)
• Deciding context equivalence of binary overlap-free words in linear time
• Linear-time version of Holub's algorithm for morphic imprimitivity testing
• Efficient algorithms for morphisms over omega-regular languages
• Noneffective regularity of equality languages and bounded delay morphisms
• Efficient constructions of test sets for regular and context-free languages

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