On Equivalence and Containment Problems for Formal Languages

DOI10.1145/322017.322020zbMATH Open0359.68087OpenAlexW2043898749MaRDI QIDQ4131690FDOQ4131690

Authors: H. B. III Hunt, Daniel J. Rosenkrantz 

Publication date: 1977

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322017.322020

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (6)

• Descriptional and Computational Complexity of Finite Automata
• Descriptional and computational complexity of finite automata -- a survey
• Classifying the computational complexity of problems
• Bond-free DNA language classes
• On the undecidability and descriptional complexity of synchronized regular expressions
• Double Greibach operator grammars

This page was built for publication: On Equivalence and Containment Problems for Formal Languages

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