Skip to main content
Springer Nature Link
Log in

A Special Case of a Unary Regular Language Containment

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

Abstract

Given an n-state unary finite automaton accepting a language T, and an ultimately periodic set S given as a union of arithmetic progressions that can be represented using nO(1) bits, and whose periods are mutually coprime, deciding whether T ⫅ S is in nO(log n) time. Dropping the mutual coprimality condition, this containment problem becomes NP-hard.

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
$34.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 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. School of Information Technology, James Cook University, Townsville, Queensland 4811, Australia

    B. Litow

Authors
  1. B. Litow
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to B. Litow.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Litow, B. A Special Case of a Unary Regular Language Containment. Theory Comput Syst 39, 743–751 (2006). https://doi.org/10.1007/s00224-005-1224-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-005-1224-4

Keywords