Abstract
A quadratic regularity test is presented for non-deleting simple deterministic contextfree tree grammars as well as for non-deleting macro S grammars.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V.; Hopcroft, J.E.; Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974
Courcelle, B.: A Representation of Trees by Languages. TCS 6, p. 255–279 and 7, p.25–55, 1978
Damm, W.: The IO-and OI-Hierarchies. TCS 20, p. 95–207, 1982
Engelfriet, J.; Meineche Schmidt, E.: IO and OI. JCSS 15, p. 328–353, 1977, and 16, p. 67–99, 1978
Engelfriet, J.: Iterated Pushdown Automata and Complexity Classes. Proc. 15th STOC, April 1983 (Boston), p. 365–373
Guessarian, I.: Program Transformations and Algebraic Semantics. JCSS 9, p. 39–65, 1979
Harrison, M.A.: Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978
Oyamaguchi, Michio: Some Results on Subclass Containment Problems for Special Classes of DPDA's Related to Nonsingular Machines. TCS 31, p. 317–335, 1984
Seidl, Helmut: A Quadratic Regularity Test for Non-Deleting Macro S Grammars. Technical Report 1985
Seidl, Helmut: Regularity Tests for some Subclasses of Level n Grammars. (In preparation)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Seidl, H. (1985). A quadratic regularity test for non-deleting macro s grammars. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028826
Download citation
DOI: https://doi.org/10.1007/BFb0028826
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15689-5
Online ISBN: 978-3-540-39636-9
eBook Packages: Springer Book Archive