On a subclass of \(\infty\)-regular languages (Q1104761)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a subclass of -regular languages |
scientific article; zbMATH DE number 4057033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On a subclass of \(\infty\)-regular languages |
scientific article; zbMATH DE number 4057033 |
Statements
On a subclass of \(\infty\)-regular languages (English)
0 references
1988
0 references
G-machines are considered as generators of sets of finite and infinite sequences, called G-languages. This paper focuses on the characterization of G-languages in terms of \(\infty\)-regular languages. It is shown that the class of G-languages is a proper subclass of the class of \(\infty\)- regular languages. It is also pointed out that the deterministic version of G-machines is essentially weaker.
0 references
G-machines
0 references
G-languages
0 references
\(\infty \)-regular languages
0 references
0 references
0.7985687851905823
0 references
0.740786612033844
0 references
0.7401598691940308
0 references
0.7382815480232239
0 references
