Skip to main content
SpringerLink
Log in

Special Factors and Uniqueness Conditions in Rational Trees

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract.

We extend the notion of a special factor of a word to complete trees with labeled nodes. This allows us to establish some uniqueness conditions for rational trees which are natural extensions of analogous results for ultimately periodic words. As an application to rational languages, we obtain an improvement of Moore's result on Automata Equivalence.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Istituto di Cibernetica del CNR,arturo@arturo.cib.na.cnr.it , Istituto di Cibernetica del CNR, via Toiano 6, 80072 Arco Felice (NA), Italy, IT

    A. Carpi

  2. Dipartimento di Matematica,deluca@mat.uniroma1.it , Università di Roma ``La Sapienza,'' piazzale Aldo Moro 2, 00185 Roma, Italy, IT

    A. de Luca

  3. Dipartimento di Matematica, varricch@mat.uniroma2.it, Università di Roma ``Tor Vergata,'' viale della Ricerca Scientifica, 00133 Roma, Italy, IT

    S. Varricchio

Authors
  1. A. Carpi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. de Luca
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Varricchio
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received July 18, 2000. Online publication May 18, 2001.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Carpi, A., de Luca, A. & Varricchio, S. Special Factors and Uniqueness Conditions in Rational Trees. Theory Comput. Systems 34, 375–395 (2001). https://doi.org/10.1007/s00224-001-1006-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-001-1006-6

Search

Navigation