Friedrich J. Urbanek

15 papers A* 1Journal 14
YearRankTypeTitle / Venue / Authors
2002 J jnl
Heyting Algebras and Formal Languages.
J. Univers. Comput. Sci.
Werner Kuich, Norbert Sauer, Friedrich J. Urbanek
1993 J jnl
A simple lamda-term representing the predecessor function with respect to church numerials.
Bull. EATCS
Friedrich J. Urbanek
1992 J jnl
A note on the language operator "red".
Bull. EATCS
Friedrich J. Urbanek
1992 J jnl
O = square.
Bull. EATCS
Friedrich J. Urbanek
1990 J jnl
A Simple Completeness Proof for Early's Algorithm.
Bull. EATCS
Friedrich J. Urbanek
1989 J jnl
Factorial Languages with Quadratically Upper Bounded Growth Functions and Nonlinearly Upper Bounded Subword Complexities.
Inf. Process. Lett.
Gerd Baron, Friedrich J. Urbanek
1989 J jnl
On minimizing finite automata.
Bull. EATCS
Friedrich J. Urbanek
1986 J jnl
On Greibach Normal Form Construction.
Theor. Comput. Sci.
Friedrich J. Urbanek
1985 J jnl
On Greibach Normal Form Construction.
Theor. Comput. Sci.
Friedrich J. Urbanek
1983 J jnl
Infinite Linear Systems and one Counter Languages.
Theor. Comput. Sci.
Werner Kuich, Friedrich J. Urbanek
1983 J jnl
On monotone functions of tree structures.
Discret. Appl. Math.
Helmut Prodinger, Friedrich J. Urbanek
1980 J jnl
An O(log n) Algorithm for Computing the n
Inf. Process. Lett.
Friedrich J. Urbanek
1979 J jnl
Infinite 0-1-sequences without long adjacent identical blocks.
Discret. Math.
Helmut Prodinger, Friedrich J. Urbanek
1979 J jnl
Language Operators Related to Init.
Theor. Comput. Sci.
Helmut Prodinger, Friedrich J. Urbanek
1979 A* conf
On the Height of Derivation Trees.
ICALP
Werner Kuich, Helmut Prodinger, Friedrich J. Urbanek