The goodness of \S,a\-EOL forms is decidable
From MaRDI portal
Publication:584929
DOI10.1016/0166-218X(83)90082-3zbMATH Open0524.68043OpenAlexW2005254197MaRDI QIDQ584929FDOQ584929
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
Cites Work
- Description of developmental languages using recurrence systems
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- On fixed, terminal fixed and nonterminal fixed interpretations of E0L forms
- Uniform interpretations of L forms
- On Good EOL Forms
- Title not available (Why is that?)
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)
