Skip to main content
SpringerLink
Log in

A note on pure and p-pure languages

  • Original Paper
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

A variation of first order logic with variables for exponents is developed to solve some problems in the setting of rational languages on the free monoid, implying in particular algorithms for purity and p-purity. This same problem is addressed for the case of rational free group languages, and characterizations of the rational subsets of \(\mathbb{N}\) involved are also obtained.

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. Centro de Matemática, Faculdade de Ciências, Universidade do Porto, R. Campo Alegre 687, 4169-007, Porto, Portugal

    Pedro V. Silva

Authors
  1. Pedro V. Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pedro V. Silva.

Additional information

Received: 5 December 2002,

Pedro V. Silva: http://www.fc.up.pt/cmup

Rights and permissions

Reprints and permissions

About this article

Cite this article

Silva, P.V. A note on pure and p-pure languages. Acta Informatica 39, 579–595 (2003). https://doi.org/10.1007/s00236-003-0107-x

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-003-0107-x

Keywords

Search

Navigation