Checking sets, test sets, rich languages and commutatively closed languages

DOI10.1016/0022-0000(83)90022-3MaRDI QIDQ1837540zbMATH OpenOpenAlexFDO

Authors J. Albert, D. Wood

Publication date 1983

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(83)90022-3

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3750326 (Why is no real title available?)
• scientific article; zbMATH DE number 3509706 (Why is no real title available?)
• scientific article; zbMATH DE number 3577484 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• A homomorphic characterization of time and space complexity classes of languages†
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• Equality Sets and Complexity Classes
• On the decidability of homomorphism equivalence for languages
• Some decidability results about regular and pushdown translations
• Test sets and checking words for homomorphism equivalence

Cited in

(4)

• Inverse morphic equivalence on languages
• Linear size test sets for certain commutative languages
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
• Polynomial size test sets for commutative languages

This page was built for publication: Checking sets, test sets, rich languages and commutatively closed languages

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