[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Deterministic sequential functions

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

The simple rational partial functions accepted by generalized sequential machines are shown to coincide with the compositions ℋ ℋ −1 P ℋ, where ℋ P consists of the prefix codings. The rational functions accepted by generalized sequential machines are proved to coincide with the compositions ℋ ℳℋ −1 P ℛ ℋ , where ℳ is the family of endmarkers and ℛ is the family of removals of endmarkers. (The compositions are read from left to right). We also show that ℳ ℋℋ −1 P ℋ is the family of the subsequential functions.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berstel, J.: Transductions and context-free languages. Stuttgart: B. G. Teubner 1979

    Google Scholar 

  2. Choffrut, C., Culik, K. II: Properties of finite and pushdown transducers. SIAM J. Comput.12, 300–315 (1983)

    Google Scholar 

  3. Eilenberg, S.: Automata, languages, and machines, Vol. A. New York: Academic Press 1974

    Google Scholar 

  4. Harju, T., Kleijn, H.C.M., Latteux, M.: Compositional representation of rational functions. RAIRO Theoret. Inf.26, 243–255 (1992)

    Google Scholar 

  5. Karhumäki, J., Linna, M.: A note on morphic characterization of languages. Discrete Appl. Math.5, 243–246 (1983)

    Google Scholar 

  6. Latteux, M., Leguy, J.: On the composition of morphisms and inverse morphisms (Lect. Notes Comput. Sci., vol. 154, pp. 420–432) Berlin Heidelberg New York: Springer 1983

    Google Scholar 

  7. Latteux, M., Turakainen, P.: A new normal form for the compositions of morphisms and inverse morphisms. Math. Syst. Theory20, 261–271 (1987)

    Google Scholar 

  8. Turakainen, P.: A homomorphic characterization of principal semi-AFLs without using intersection with regular sets. Inf. Sci.27 141–149 (1982)

    Google Scholar 

  9. Turakainen, P.: A machine-oriented approach to compositions of morphisms and inverse morphisms. EATCS Bull.20, 162–166 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, SF-20500, Turku, Finland

    T. Harju

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300 RA, Leiden, The Netherlands

    H. C. M. Kleijn

  3. Laboratoire d'Informatique Fondamentale de Lille, CNRS UA 369, Université de Lille I, F-59655, Villeneuve d'Ascq Cedex, France

    M. Latteux

Authors
  1. T. Harju
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. C. M. Kleijn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Latteux
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was partially supported by the Esprit Basic Research Action Working Group No. 3166 ASMICS, the CNRS and the Academy of Finland

Rights and permissions

Reprints and permissions

About this article

Cite this article

Harju, T., Kleijn, H.C.M. & Latteux, M. Deterministic sequential functions. Acta Informatica 29, 545–554 (1992). https://doi.org/10.1007/BF01185560

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation