Infinite linear systems and one counter languages. (English) Zbl 0516.68059


68Q45 Formal languages and automata
Full Text: DOI


[1] Berstel, J., Transductions and Context-Free Languages (1979), Teubner: Teubner Stuttgart · Zbl 0424.68040
[2] Deussen, P., A decidability criterion for van Wijngaarden grammars, Acta Informat., 5, 353-375 (1975) · Zbl 0327.68022
[3] Ginsburg, S.; Goldstine, J.; Greibach, S., Some uniformly erasable families of languages, Theoret. Comput. Sci., 2, 29-44 (1976) · Zbl 0343.68033
[4] Kuich, W., On the entropy of context-free languages, Information and Control, 16, 173-200 (1970) · Zbl 0193.32603
[5] Kuich, W., Systems of pushdown acceptors and context-free grammars, Elektron. Informationsverarb. Kybernet., 6, 95-114 (1970) · Zbl 0193.32701
[6] Kuich, W., Zur Theorie algebraischer Systeme, Elektron. Informationsverarb. Kybernet., 17, 3-14 (1981) · Zbl 0467.68062
[7] Kuich, W.; Walk, K., Block-stochastic matrices and associated finite-state languages, Computing, 1, 50-61 (1966) · Zbl 0138.15304
[8] Salomaa, A.; Soittola, M., Automata-Theoretic Aspects of Formal Power Series (1979), Springer: Springer Berlin
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.