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

DOI10.1016/0022-0000(83)90022-3zbMath0507.68049OpenAlexW2061705910MaRDI QIDQ1837540

Juergen Albert, Derick 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)

Related Items (4)

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

Cites Work

• Test sets and checking words for homomorphism equivalence
• On the decidability of homomorphism equivalence for languages
• Some decidability results about regular and pushdown translations
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• A homomorphic characterization of time and space complexity classes of languages†
• Equality Sets and Complexity Classes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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