The goodness of \(\{S,a\}\)-EOL forms is decidable

DOI10.1016/0166-218X(83)90082-3zbMath0524.68043OpenAlexW2005254197MaRDI QIDQ584929

Grzegorz Rozenberg, R. Verraedt

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0166-218x(83)90082-3

zbMATH Keywords

decidabilitygoodnessEOL form

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Grammar and L forms: an introduction
• Many-to-one simulation in EOL forms is decidable
• Synchronized and desynchronized EOL forms
• On epsilon productions for terminals in EOL forms
• Completeness of EOL forms is decidable
• Marvellous interpretations differ little but decisively from ordinary interpretations of EOL forms
• Basic formulas and languages. I: The theory
• Basic formulas and languages. II: Applications to EOL systems and forms
• EOL forms
• On two-symbol complete EOL forms
• On fixed, terminal fixed and nonterminal fixed interpretations of E0L forms
• Description of developmental languages using recurrence systems
• Uniform interpretations of L forms
• On Good EOL Forms

This page was built for publication: The goodness of \(\{S,a\}\)-EOL forms is decidable