Algorithms for determining relative inclusion star height and inclusion star height (Q1183589): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(91)90269-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092604732 / rank | |||
Normal rank | |||
Revision as of 01:48, 20 March 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
relative star height
0 references
star height
0 references
relative inclusion star height
0 references
