Skip to main content
SpringerLink
Log in

A characterization of the classes L1 and R1 of primitive recursive word functions

  • Algorithmen- Und Komplexitätstheorie
  • Conference paper
  • First Online:
GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen

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

  • 1627 Accesses

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. von Henke, Indermark and Weihrauch: Hierarchies of primitive recursive wordfunctions and transductions defined by automata, in Nivat: Automata, Languages and Programming, IRIA-Symposium July 3–7, 1972

    Google Scholar 

  2. Tsichritzis, A note on comparison of subrecursive hierarchies, Inf. Proc. Lett. 1 (71) 42–44

    Google Scholar 

Download references

Authors
  1. G. F. Rose
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Weihrauch
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag

About this paper

Cite this paper

Rose, G.F., Weihrauch, K. (1973). A characterization of the classes L1 and R1 of primitive recursive word functions. In: GI Gesellschaft für Informatik e. V. 1. Fachtagung über Automatentheorie und Formale Sprachen. Lecture Notes in Computer Science, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039163

Download citation

  • DOI: https://doi.org/10.1007/BFb0039163

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06527-2

  • Online ISBN: 978-3-540-37826-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation