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

Fair sticker languages

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

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract.

Codings of fair sticker languages are characterized as languages accepted by blind one-counter automata.

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

Access this article

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.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received 17 March 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hoogeboom, H., van Vugt, N. Fair sticker languages. Acta Informatica 37, 213–225 (2000). https://doi.org/10.1007/PL00006050

Download citation

  • Issue Date:

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

Navigation