Abstract
Here is introduced a new operation between languages noted ∇ in order to study their structural complexity. Two languages L and M being given, we say that L is of structural complexity greater than M iff the full semi-A F L F(M) generated by M is included in the full semi-A F L F(L) generated by L. Then ∇ satisfies the property that, when applied to some structurally comparable languages, it produces a language of intermediary structural complexity.
We use the ∇ operation to build a context-free language which has structural complexity greater than any finite-turn language but is not context-free generator.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
AUTEBERT J.M., BEAUQUIER J., BOASSON L., NIVAT M. — Quelque problèmes ouverts en théorie des languages algébriques, R.A.I.R.O. Informatique théorique 13 (1979), p. 363–379.
BEAUQUIER J. — Contribution à l'étude de la complexité structurelle des langages algébriques, Thèse d'Etat, Université Paris VII (1977).
BEAUQUIER J. — Générateurs algébriques et systèmes de paires itérantes, Theoretical Computer Science 8, (1979), p. 293–323.
BEAUQUIER J. — Deux familles de langages incomparables, Information and Control 43, no 2, (1979), p. 101–122.
BERSTEL J. — Transductions and context-free languages, Teubner Verlag (1979).
BOASSON L. — Langages algébriques, paires itérantes et transductions rationnelles, Theoretical Computer Science 2 (1976), p. 209–223.
CRESTIN J.P. — Langages quasi-rationnels, ultralinéaires et bornés, in Langages algébriques, ENSTA Paris (1973).
GINSBURG S. — Algebraic and Automata-Theoretic Properties of Formal Languages Amsterdam, New York, Oxford (1975).
GINSBURG S., GREIBACH S.A., HOPCROFT J.E. — Pre AFL, in: Studies in abstract families of languages, Mem. of the Amer. Math Soc. 87 (1969), p. 41–51.
GINSBURG S., SANIER E.H. — Finite-turn pushdown automata, SIAM J. Control 4 (1966), p. 429–453.
GINSBURG S., SPANIER E.H. — Derivation bounded languages, J. Computer System Sciences 2 (1968), p. 228–250.
GOLDSTINE J. — Substitution and bounded languages, Journ. of Computer and System Sciences 6 (1972), p. 9–29.
GREIBACH S.A. — Chains of full AFL's, Math. Syst. Theory 4 (1970) p. 231–242.
GREIBACH S.A. — Syntactic operators on full semi-AFL's, J. Computer System Sciences 6 (1972), p. 30–76.
GREIBACH S.A. — One counter languages and the IRS condition, J. of Comp. and Syst. Sciences 10, (1975), p. 237–247.
GREIBACH S.A. — The hardest context-free language, SIAM J. of Computing 2, (1973), p. 304–310.
HARRISON M.A. — Introduction to formal languages theory, London, Amsterdam, Sydney.
NIVAT M. — Transductions de langages de Chomsky, Ann. de l'Institut Fourier 18, (1968), p. 359–456.
OGDEN W. — A helpful result for proving inherent ambiguity, Math. System. Theory 2, (1968), p. 191–194.
STEARNS R.E. — A regularity test for pushdown machines, Information and Control 11 (1961), p. 323–340.
SALOMAA A. — Formal languages, New York, San Francisco, London.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beauquier, J. (1981). A new operation between languages. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_44
Download citation
DOI: https://doi.org/10.1007/3-540-10854-8_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10854-2
Online ISBN: 978-3-540-38765-7
eBook Packages: Springer Book Archive