Abstract
We study here a kind of rewriting systems called controlled rewriting systems (c-systems for short) which generalise the notion of regular semi-Thue systems. We show that the deterministic context-free languages are exactly the sets of the form [R] ↔ ⋅ s , where R is a rational set and ↔ ⋅ S is the right-congruence generated by a c-system of S of a restricted type ( S is basic and confluent).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
