Algorithms for determining relative inclusion star height and inclusion star height

DOI10.1016/0304-3975(91)90269-8zbMath0755.68086OpenAlexW2092604732MaRDI QIDQ1183589

Kosaburo Hashiguchi

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90269-8

zbMATH Keywords

star heightrelative star heightrelative inclusion star height

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA ⋮ New upper bounds to the limitedness of distance automata

Cites Work

• Unnamed Item
• Unnamed Item
• The solutions of two star-height problems for regular trees
• Improved limitedness theorems on finite automata with distance functions
• Limitedness theorem on finite automata with distance functions
• Representation theorems on regular languages
• Algorithms for determining relative star height and star height
• A decision procedure for the order of regular events
• Transition graphs and the star-height of regular events
• General properties of star height of regular events
• Star height of certain families of regular events
• Regular languages of star height one
• Homomorphisms that preserve star height
• The star height of reset-free events and strictly locally testable events
• Roots of Star Events
• The loop complexity of pure-group events
• On a question of Eggan
• Techniques for establishing star height of regular sets

This page was built for publication: Algorithms for determining relative inclusion star height and inclusion star height