Skip to main content
SpringerLink
Log in

Ultralinear expressions

  • Formal Languages
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science (MFCS 1974)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 28))

  • 2017 Accesses

Abstract

The bracket operation, [A, B]={a b ã' : (a, a') ε A, b ε B} is used jointly with product and union to define ultralinear languages. General properties of this operation and of the operator on families of languages associated with it are given. A decomposition of the family of ultralinear languages into a semilattice of principal semiAFLs is obtained by these means.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.B. BANERJI, Phrase structure language, finite machines and channel capacity, Information and Control 16, (1963), 153–162.

    Google Scholar 

  2. L. BOASSON, J.P. CRESTIN, M. NIVAT, Familles de langages translatables et fermées par crochet, Acta Informatica 2 (1973), 383–393.

    Google Scholar 

  3. L. BOASSON, M. NIVAT, Sur diverses familles de langages fermées par transduction rationnelle, Acta Informatica 2 (1973), 180–188.

    Google Scholar 

  4. N. CHOMSKY, M.P. SCHUTZENBERGER, The algebraic theory of context-free languages, in Computer Programming and Formal System, Ed. P. Braffort, D. Hirschberg, North-Holland, Amsterdam (1967), 118–161.

    Google Scholar 

  5. A.B. CREMERS, S. GINSBURG, Context-free grammar forms, in Automata, Languages and Programming, Ed. J. Loeckx, Springer Verlag, Berlin (1974), 364–382.

    Google Scholar 

  6. S. GINSBURG, E.H. SPANIER, Finite-turn pushdown automata, SIAM J. Control 4 (1966), 429–453

    Google Scholar 

  7. S. GREIBACH, Syntactic operators on full semiAFLs, J. Comput. System Sciences 6 (1972), 30–76

    Google Scholar 

  8. M. NIVAT, Transduction des langages de Chomsky, Annales de l'Institut Fourier 18 (1968), 339–456.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ecole Nationale Supérieure de Techniques Avancées, Paris

    J. P. Crestin

Authors
  1. J. P. Crestin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

A. Blikle

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Crestin, J.P. (1975). Ultralinear expressions. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_682

Download citation

  • DOI: https://doi.org/10.1007/3-540-07162-8_682

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07162-4

  • Online ISBN: 978-3-540-37492-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation