Old stuff: Languages, Words, Grammars, etc.

Language operators related to init H. Prodinger and F.J. Urbanek, Theoretical Computer Science, 8:161-175, 1979.
On a generalization of the Dyck-language over a two letter alphabet H. Prodinger, Discrete Mathematics, 28:269-276, 1979.

Infinite 0-1-sequences without long adjacent identical blocks H. Prodinger and F.J. Urbanek, Discrete Mathematics, 28:277-289, 1979.
On the height of derivation trees W. Kuich, H. Prodinger and F.J. Urbanek, Automata, Languages and Programming, volume 71, pages 370-384, 1979.
On the interpolation of D0L-sequences H. Prodinger, Theoretical Computer Science, 10:107-108, 1980.
Congruences defined by languages and filters H. Prodinger, Information and Control, 44:36-46, 1980.
Topologies on free monoids defined by closure operators of a special type H. Prodinger, RAIRO Theoretical Informatics and Applications, 14:225-237, 1980.
Non-repetitive sequences and Gray code, H. Prodinger, Discrete Mathematics, 43:113-116, 1983.
Topologies over free monoids induced by families of languages, H. Prodinger, RAIRO Theoretical Informatics and Applications, 17:285-290, 1983.
Towards a general concept of hypercodes, H. Prodinger and G. Thierrin, Journal of Information and Optimization Sciences, 4:255-268, 1983.

(Back to the Homepage)