Abstract
Pre-NTS languages have been introduced together with NTS languages by Boasson and Sénizergues. In this paper we study the pre-NTS grammars. Our main result is that pre-NTS grammars have a decidable equivalence problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Autebert J.-M.:Langages algébriques, Masson, Paris, 1987.
Berstel J.:Transductions and Context-Free Languages, Teubner Verlag, Stuttgart, 1979.
Boasson L., and Sénizergues G.: NTS languages are deterministic and congruential,Journal on Computer Science and Systems,31 (1985), 332–342.
Ginsburg S.:The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966.
Sénizergues G.: Décidabilité de l'équivalence des langages NTS, Thèse de 3° cycle de l'Université Paris 7, Paris, 1981.
Sénizergues G.: A new class of CFL for which the equivalence is decidable,Information Processing Letters,13 (1981), 30–34.
Sénizergues G.: The equivalence and inclusion problems for NTS languages,Journal on Computer Science and Systems,31 (1985), 303–331.
Valiant L.: The equivalence problem for deterministic finite-turn push-down automata,Information and Control,25 (1974), 123–133.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Autebert, J.M., Boasson, L. The equivalence of pre-NTS grammars is decidable. Math. Systems Theory 25, 61–74 (1992). https://doi.org/10.1007/BF01368784
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01368784