On the Height of Derivation Trees. - Werner Kuich; Helmut Prodinger; Friedrich J. Urbanek (ICALP, 1979)

Infinite 0-1-sequences without long adjacent identical blocks. - Helmut Prodinger; Friedrich J. Urbanek (Discret. Math., 1979)

Language Operators Related to Init. - Helmut Prodinger; Friedrich J. Urbanek (Theor. Comput. Sci., 1979)

An O(log n) Algorithm for Computing the nth Element of the Solution of a Difference Equation. - Friedrich J. Urbanek (Inf. Process. Lett., 1980)

On monotone functions of tree structures. - Helmut Prodinger; Friedrich J. Urbanek (Discret. Appl. Math., 1983)

Infinite Linear Systems and one Counter Languages. - Werner Kuich; Friedrich J. Urbanek (Theor. Comput. Sci., 1983)

On Greibach Normal Form Construction. - Friedrich J. Urbanek (Theor. Comput. Sci., 1986)

On minimizing finite automata. - Friedrich J. Urbanek (Bull. EATCS, 1989)

Factorial Languages with Quadratically Upper Bounded Growth Functions and Nonlinearly Upper Bounded Subword Complexities. - Gerd Baron; Friedrich J. Urbanek (Inf. Process. Lett., 1989)

A Simple Completeness Proof for Early's Algorithm. - Friedrich J. Urbanek (Bull. EATCS, 1990)

A note on the language operator "red". - Friedrich J. Urbanek (Bull. EATCS, 1992)

O = square. - Friedrich J. Urbanek (Bull. EATCS, 1992)

A simple lamda-term representing the predecessor function with respect to church numerials. - Friedrich J. Urbanek (Bull. EATCS, 1993)

Heyting Algebras and Formal Languages. - Werner Kuich; Norbert Sauer; Friedrich J. Urbanek (J. Univers. Comput. Sci., 2002)