IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-3352-7_17.html
   My bibliography  Save this book chapter

Algorithms for determining relative star height and star height

In: Sequences

Author

Listed:
  • Kosaburo Hashiguchi

    (Toyohashi University of technology)

Abstract

Eggan(l963) introduced the notion of the star height to each regular expression which is a nonnegative integer denoting the nestedness of star operators in this expression. The star height of a regular language is the minimum of the star height of regular expressions denoting this language. We remark here that to each regular language, there exist generally infinitely many regular expressions denoting this language. Eggan(l963) showed that for each nonnegative integer k, there exists a regular language of star height k, and posed the problem of determining the star height of any regular language. Dejean and Schutzenberger (1966) showed that for each nonnegative integer k, there exists a regular language of star height k over the two-letter alphabet. McNaughton (1967) presented an algorithm for determining the loop complexity (i.e., the star height) of any regular language whose syntactic monoid is a group. Cohen (1970, 1971) and Cohen and Brzozowski (1970) investigated many properties of star height, some of which provide algorithms for determining the star height of any regular language of certain reset-free type. Hashiguchi and Honda (1979) presented an algorithm for determining the star height of any reset-free language and any reset language. Hashiguchi (1982B) presented an algorithm for deciding whether or not an arbitrary language is of star height one. To obtain this result, it uses the limitedness theorem on finite automata with distance functions (in short, D-automata) in Hashiguci (1982A, 1983).

Suggested Citation

  • Kosaburo Hashiguchi, 1990. "Algorithms for determining relative star height and star height," Springer Books, in: Renato M. Capocelli (ed.), Sequences, pages 228-243, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4612-3352-7_17
    DOI: 10.1007/978-1-4612-3352-7_17
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4612-3352-7_17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.