On Equivalence and Containment Problems for Formal Languages

From MaRDI portal

Revision as of 09:04, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4131690

Jump to:navigation, search

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

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

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4131690&oldid=17922840"