Acta Informatica

, Volume 11, Issue 3, pp 233–240 | Cite as

Intersections de langages algébriques bornés

  • Michel Latteux
Article
Received:
Revised:

Intersections of bounded algebraic languages

Summary

We study the family SLB of morphic images of the intersection of two bounded Context-free languages. In particular, we prove the equality between this family and the family of finite intersection of bounded Context-free languages.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Références

  1. 1.
    Book, R., Nivat, M., Paterson, M.: Intersections of linear context-free languages and reversalbounded multipushdown machines, Procedings of sixth annual ACM Symposium on theory of Computing 290–296 (1974)Google Scholar
  2. 2.
    Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines, I.E.E.E. Transactions on Computer vol. C-18, 4, 349–365 (1969)Google Scholar
  3. 3.
    Cole, S.N.: Deterministic pushdown store machines and real-time computation, J.A.C.M. 18, 306–328 (1971)Google Scholar
  4. 4.
    Eilenberg, S.: Automata, languages and machines, Vol. A, New-York: Academic Press 1974Google Scholar
  5. 5.
    Ginsburg, S.: The mathematical theory of context-free languages, New York: McGraw-Hill 1966Google Scholar
  6. 6.
    Ginsburg, S., Greibach, S.: Deterministic context-free languages, Information and Control 9, 620–648 (1966)Google Scholar
  7. 7.
    Ginsburg, S., Spanier, E.M.: AFL with the semilinear property, J. Comp. Syst. Sc. 5, 365–396 (1971)Google Scholar
  8. 8.
    Latteux, M.: Sur les semilinéaires-langages bornés, Publication du Laboratoire de Calcul de l'Université de Lille I, n∘ 60 (1975)Google Scholar
  9. 9.
    Latteux, M.: Cônes rationnels commutativement clos, R.A.I. R.O. Informatique théorique 11, 29–51 (1977)Google Scholar
  10. 10.
    Liu, L.Y., Weiner, P.: A characterization of semilinear sets, J. Comp. Syst. Sc. 4, 299–307 (1970)Google Scholar
  11. 11.
    Liu, L.Y., Weiner, P.: An infinite hierarchy of intersections of context-free languages. Math. Systems theory 7, 185–192 (1973)Google Scholar
  12. 12.
    Wotschke, D.: Nondeterminism and Boolean operations in pda's, J. Comp. Syst. Sc. 16, 456–461 (1978)Google Scholar

Copyright information

© Springer-Verlag 1979

Authors and Affiliations

  • Michel Latteux
    • 1
  1. 1.U.E.R. I.E.E.A., Service InformatiqueUniversité de Lille IVilleneuve d'AscqFrance

Personalised recommendations