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

DOI10.1016/0022-0000(83)90022-3zbMATH Open0507.68049OpenAlexW2061705910MaRDI QIDQ1837540FDOQ1837540

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Elementary homomorphisms and a solution of the DOL sequence equivalence problem
• Title not available (Why is that?)
• On the decidability of homomorphism equivalence for languages
• Some decidability results about regular and pushdown translations
• Test sets and checking words for homomorphism equivalence
• Title not available (Why is that?)
• A homomorphic characterization of time and space complexity classes of languages†
• Equality Sets and Complexity Classes

Cited In (4)

• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids
• Linear size test sets for certain commutative languages
• Polynomial size test sets for commutative languages
• Inverse morphic equivalence on 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)