# Friedrich J. Urbanek

According to our database

Collaborative distances:

^{1}, Friedrich J. Urbanek authored at least 14 papers between 1979 and 2002.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2002

J. Univers. Comput. Sci., 2002

1993

A simple lamda-term representing the predecessor function with respect to church numerials.

Bull. EATCS, 1993

1992

O = square.

Bull. EATCS, 1992

A note on the language operator "red".

Bull. EATCS, 1992

1990

A Simple Completeness Proof for Early's Algorithm.

Bull. EATCS, 1990

1989

Factorial Languages with Quadratically Upper Bounded Growth Functions and Nonlinearly Upper Bounded Subword Complexities.

Inf. Process. Lett., 1989

On minimizing finite automata.

Bull. EATCS, 1989

1986

Theor. Comput. Sci., 1986

1983

Theor. Comput. Sci., 1983

Discret. Appl. Math., 1983

1980

An O(log n) Algorithm for Computing the n<sup>th</sup> Element of the Solution of a Difference Equation.

Inf. Process. Lett., 1980

1979

Theor. Comput. Sci., 1979

Discret. Math., 1979

Proceedings of the Automata, 1979