Abstract
Languages can be defined by semi-Thue systems in various ways. They can be described as sentential form languages, studied in detail by Kudlek and the author in [156], or they can be connected to well-quasi orders as done by Ehrenfeucht, Haussler and Rozenberg in [91]. Narendran and McNaughton combined the rewriting by STSs with additional nonterminal symbols in [218]. We shall here restrict our attention to languages describable in the form of congruence classes [L], sets of descendants Δ*(L), or sets of ancestors <L>*, where L is a language from one of the Chomsky families.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jantzen, M. (1988). Congruential Languages Specified by Semi-Thue Systems. In: Confluent String Rewriting. EATCS Monographs on Theoretical Computer Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61549-8_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-61549-8_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64867-0
Online ISBN: 978-3-642-61549-8
eBook Packages: Springer Book Archive