Skip to main content
SpringerLink
Log in

Subsequential functions: Characterizations, minimization, examples

  • Part II Invited Lectures
  • Conference paper
  • First Online:
Aspects and Prospects of Theoretical Computer Science (IMYCS 1990)

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

Included in the following conference series:

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. J. Berstel, Transductions and context-free languages, Teubner (1979).

    Google Scholar 

  2. R. Boyer, J.S. Moore, A fast string searching algorithm, Comm. Assoc. Comput. Machin. 20, 10 (1977) 762–772.

    Google Scholar 

  3. C. Choffrut, Une caractérisation des fonctions séquentielles et des fonctions sousséquentielles en tant que relations rationnelles, Theor. Comput. Sci. 5 (1977) 325–337.

    Google Scholar 

  4. C. Choffrut, Contribution à l'étude de quelques familles remarquables de fonctions rationnelles, Thèse Sci. Math. Université Paris VII (1978).

    Google Scholar 

  5. C. Choffrut, A generalization of Ginsburg and Rose's characterization of g-s-m mappings, Proc. of the 6th Intern. Congress on Automata, Languages and Programming, Graz (1979), Lecture Notes Comput. Sci. 71, 88–103.

    Google Scholar 

  6. S. Eilenberg, Automata, languages and machines, vol. A, Acad. Press (1974).

    Google Scholar 

  7. S. Ginsburg, An introduction to mathematical machine theory, Addison-Wesley, Reading, Massachussets (1962).

    Google Scholar 

  8. S. Ginsburg, G.F. Rose, A characterization of machine mappings, Can. J. Math. 18 (1966) 381–388.

    Google Scholar 

  9. D.E. Knuth, J.H. Morris, V.R. Pratt, Fast pattern-matching in strings, S.I.A.M. J. Comput. 6(1977) 323–350.

    Google Scholar 

  10. G. Raney, Sequential functions, J.Assoc. Comput. Mach. 5 (1958) 177–180.

    Google Scholar 

  11. C. Reutenauer, M.-P. Schützenberger, Minimization of rational word functions, to appear in Siam J. of Computing.

    Google Scholar 

  12. M.P. Schützenberger, Sur une variante des fonctions séquentielles, Theor. Comput. Sci. 4 (1977) 47–57.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Math-info, UQAM, Succ. A, C.P. 8888, H3C 3P8, Montréal, Canada

    Christophe Reutenauer

Authors
  1. Christophe Reutenauer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dassow Jozef Kelemen

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reutenauer, C. (1990). Subsequential functions: Characterizations, minimization, examples. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-53414-8_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53414-3

  • Online ISBN: 978-3-540-46869-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation