Completeness of EOL forms is decidable
From MaRDI portal
Publication:1154290
DOI10.1007/BF00262977zbMath0464.68078OpenAlexW2086551263MaRDI QIDQ1154290
R. Verraedt, Grzegorz Rozenberg
Publication date: 1982
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00262977
Related Items (3)
Recursion and pumping in L forms ⋮ The goodness of \(\{S,a\}\)-EOL forms is decidable ⋮ On simulation and propagating EOL forms
This page was built for publication: Completeness of EOL forms is decidable