Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Benois: Parties rationnelles du groupe libre, C.R.Acad.Sci.Paris ser. A269, 1969, 1188–1190.
M.Benois et P.Butzbach: Langages algébriques déterministes et transversale rationnelle, Rapport de recherche n o 446, L.S.D. IMAG 1984.
M.Benois et J.Sakarovitch: On the complexity of some extended word problems defined by cancellation rules, Information Processing Letters à paraître.
J.Berstel: Transductions and context free languages. Teubner 1979.
R. Book, M. Jantzen and C. Wrathall, Monadic Thue Systems, Theoret. Comput. Sci. 19 (1982) 231–251.
R.V. Book and F. Otto: Cancellatio rules and extended word problems, Information Processing Letters 20, 1985,5–11.
D. Dolev and A. Yao: On the security of public key protocols, I.E.E.E. Trans.Information Theory IT 29, 1983, 198–208.
S.Eilenberg: Automata, Languages, and Machines Vol A, Academic Press, 1974.
G. Huet: Confluent reductions: Abstract properties and applications to term rewriting systems, J. Assoc. Comp. Mach. 27, 1980 797–821.
J.Hopcroft and J.Ullman: Introduction to Automata Theory, Langages and Computation Addison-Wesley, 1979.
P. Narendran: Church-Rosser and related Thue systems, Report n o 84CRD176, General Electric Corporate Research and Development, Schenectady, N.Y., 1984.
M.Nivat (et M.Benois): Congruences parfaites et quasi parfaites, Séminaire Dubreil, 25o année, 1971–72, 7-01-09.
J.Sakarovitch: Description des monoïdes de type fini, Rapport n o 80–36 LITP, 1980.
J.Sakarovitch: Syntaxe des langages de Chomsky Thèse Paris 7 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benois, M. (1987). Descendants of regular language in a class of rewriting systems: Algorithm and complexity of an automata construction. In: Lescanne, P. (eds) Rewriting Techniques and Applications. RTA 1987. Lecture Notes in Computer Science, vol 256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17220-3_11
Download citation
DOI: https://doi.org/10.1007/3-540-17220-3_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17220-8
Online ISBN: 978-3-540-47421-0
eBook Packages: Springer Book Archive