On a subclass of \(\infty\)-regular languages (Q1104761)

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.