Elsevier

Theoretical Computer Science

Volume 70, Issue 2, 26 January 1990, Pages 213-232
Theoretical Computer Science

A characterisation of deterministic context-free languages by means of right-congruences

https://doi.org/10.1016/0304-3975(90)90123-YGet rights and content
Under an Elsevier user license
open archive

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).

Cited by (0)