Many-to-one simulation in EOL forms is decidable

DOI10.1016/0166-218X(80)90056-6zbMath0442.68071OpenAlexW1974778594MaRDI QIDQ1143808

Andrzej Ehrenfeucht, Grzegorz Rozenberg, R. Verraedt

Publication date: 1980

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(80)90056-6

zbMATH Keywords

decidabilitymany-to-one simulation in EOL forms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Basic formulas and languages. I: The theory ⋮ Basic formulas and languages. II: Applications to EOL systems and forms ⋮ The goodness of \(\{S,a\}\)-EOL forms is decidable ⋮ On simulation and propagating EOL forms

Cites Work

• EOL forms
• Unnamed Item

This page was built for publication: Many-to-one simulation in EOL forms is decidable