On Equivalence and Containment Problems for Formal Languages
From MaRDI portal
Publication:4131690
DOI10.1145/322017.322020zbMath0359.68087OpenAlexW2043898749MaRDI QIDQ4131690
Daniel J. Rosenkrantz, Harry B. III Hunt
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
Related Items
On the undecidability and descriptional complexity of synchronized regular expressions ⋮ Classifying the computational complexity of problems ⋮ Bond-free DNA language classes ⋮ Descriptional and computational complexity of finite automata -- a survey ⋮ Descriptional and Computational Complexity of Finite Automata ⋮ Double Greibach operator grammars
