The goodness of \S,a\-EOL forms is decidable

DOI10.1016/0166-218X(83)90082-3MaRDI QIDQ584929zbMATH OpenOpenAlexFDO

Authors 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

• scientific article; zbMATH DE number 3692672 (Why is no real title available?)
• scientific article; zbMATH DE number 3569855 (Why is no real title available?)
• scientific article; zbMATH DE number 3604380 (Why is no real title available?)
• Basic formulas and languages. I: The theory
• Basic formulas and languages. II: Applications to EOL systems and forms
• Completeness of EOL forms is decidable
• Description of developmental languages using recurrence systems
• EOL forms
• Grammar and L forms: an introduction
• Many-to-one simulation in EOL forms is decidable
• Marvellous interpretations differ little but decisively from ordinary interpretations of EOL forms
• On Good EOL Forms
• On epsilon productions for terminals in EOL forms
• On fixed, terminal fixed and nonterminal fixed interpretations of E0L forms
• On two-symbol complete EOL forms
• Synchronized and desynchronized EOL forms
• Uniform interpretations of L forms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q584929)