On some structural properties of a subclass of \(\infty\)-regular languages (Q1098324): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3956998 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A decomposition theorem for partially ordered sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4165427 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4044156 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4094394 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4095906 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3857704 / rank | |||
Normal rank |
Latest revision as of 14:53, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On some structural properties of a subclass of \(\infty\)-regular languages |
scientific article |
Statements
On some structural properties of a subclass of \(\infty\)-regular languages (English)
0 references
1987
0 references
G-languages form a subclass of \(\infty\)-regular languages. The basic characterization of G-languages as posets is presented and some semilattice structures of G-languages are described.
0 references
G-machine
0 references
\(\infty \)-regular languages
0 references
semilattice structures
0 references
G- languages
0 references