Algorithms for determining relative inclusion star height and inclusion star height (Q1183589): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The solutions of two star-height problems for regular trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roots of Star Events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star height of certain families of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for establishing star height of regular sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: General properties of star height of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a question of Eggan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transition graphs and the star-height of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision procedure for the order of regular events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitedness theorem on finite automata with distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular languages of star height one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation theorems on regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved limitedness theorems on finite automata with distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for determining relative star height and star height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphisms that preserve star height / rank
 
Normal rank
Property / cites work
 
Property / cites work: The star height of reset-free events and strictly locally testable events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The loop complexity of pure-group events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3026370 / rank
 
Normal rank

Latest revision as of 15:49, 15 May 2024

scientific article
Language Label Description Also known as
English
Algorithms for determining relative inclusion star height and inclusion star height
scientific article

    Statements

    Algorithms for determining relative inclusion star height and inclusion star height (English)
    0 references
    28 June 1992
    0 references
    The notion of relative star height of regular languages was introduced by the author [Inf. Comput. 78, 2, 124-169 (1988; Zbl 0668.68081)]. He also showed the existence of an algorithm for determining relative star height, which solves, as a special case, the star height problem for regular languages. The present paper is a continuation of the earlier work, and introduces the notion of inclusion star height and relative inclusion star height, and shows the existence of an algorithm for determining relative inclusion star height. This implies, as a special case, the existence of an algorithm for determining inclusion star height of given regular languages.
    0 references
    0 references
    0 references
    relative star height
    0 references
    star height
    0 references
    relative inclusion star height
    0 references
    0 references