Basic formulas and languages. I: The theory

DOI10.1016/0166-218X(81)90002-0zbMath0488.68047MaRDI QIDQ1166275

Andrzej Ehrenfeucht, R. Verraedt, Grzegorz Rozenberg

Publication date: 1981

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

zbMATH Keywords

decidabilitywell-quasi-ordersEOL formsderivations in EOL systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Grammar and L forms: an introduction
• Many-to-one simulation in EOL forms is decidable
• EOL forms
• The theory of well-quasi-ordering: a frequently discovered concept
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: Basic formulas and languages. I: The theory