The Sequence Equivalence Problem is Decidable for 0S Systems

DOI10.1145/322217.322222zbMath0471.68047OpenAlexW2084036153MaRDI QIDQ3926053

Andrzej Ehrenfeucht, Grzegorz Rozenberg

Publication date: 1980

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

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

zbMATH Keywords

decision problemscontext-free grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

A characterization of context-free string languages by directed node- label controlled graph grammars ⋮ Grammatical codes of trees

This page was built for publication: The Sequence Equivalence Problem is Decidable for 0S Systems