Rebootable and suffix-closed $\omega $-power languages (Q3991292): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W179004701 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A syntactic congruence for rational \(\omega\)-languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3714479 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Adherences of languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5525343 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On?-Languages whose syntactic monoid is trivial / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decision problems forω-automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finitely generated \(\omega\)-languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4138628 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On generators of rational \(\omega\)-power languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Testing and generating infinite sequences by a finite automaton / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3899534 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite-state \(\omega\)-languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On infinitary finite length codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3777489 / rank | |||
Normal rank |
Latest revision as of 17:05, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rebootable and suffix-closed $\omega $-power languages |
scientific article |
Statements
Rebootable and suffix-closed $\omega $-power languages (English)
0 references
28 June 1992
0 references
\(\omega\)-languages
0 references
\(\omega\)-generators
0 references