On the equivalence and containment problems for context-free languages

DOI10.1007/BF01746517zbMath0175.00801OpenAlexW2094274619MaRDI QIDQ5563366

John E. Hopcrofts

Publication date: 1969

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01746517

zbMATH Keywords

languages, automata, networks

Cites Work

• Bounded Algol-Like Languages
• A note on undecidable properties of formal languages

This page was built for publication: On the equivalence and containment problems for context-free languages