- CSB - MetaPress - Google - Bing - Yahoo
 | 2002 | |
|---|---|---|
| 13 |      | Werner Kuich, Norbert Sauer, Friedrich J. Urbanek: Heyting Algebras and Formal Languages. J. UCS 8(7): 722- (2002) |
| 1993 | ||
| 12 |  | Friedrich J. Urbanek: A simple lamda-term representing the predecessor function with respect to church numerials. Bulletin of the EATCS 50: 276-279 (1993) |
| 1992 | ||
| 11 | | Friedrich J. Urbanek: O = square. Bulletin of the EATCS 46: 186-187 (1992) |
| 10 | | Friedrich J. Urbanek: A note on the language operator "red". Bulletin of the EATCS 47: 205-206 (1992) |
| 1990 | ||
| 9 | | Friedrich J. Urbanek: A Simple Completeness Proof for Early's Algorithm. Bulletin of the EATCS 42: 194 (1990) |
| 1989 | ||
| 8 | | Friedrich J. Urbanek: On minimizing finite automata. Bulletin of the EATCS 39: 205-206 (1989) |
| 7 | | Gerd Baron, Friedrich J. Urbanek: Factorial Languages with Quadratically Upper Bounded Growth Functions and Nonlinearly Upper Bounded Subword Complexities. Inf. Process. Lett. 32(5): 267-269 (1989) |
| 1986 | ||
| 6 | | Friedrich J. Urbanek: On Greibach Normal Form Construction. Theor. Comput. Sci. 44: 229-236 (1986) |
| 1985 | ||
| 5 | | Friedrich J. Urbanek: On Greibach Normal Form Construction. Theor. Comput. Sci. 40: 315-317 (1985) |
| 1983 | ||
| 4 | | Werner Kuich, Friedrich J. Urbanek: Infinite Linear Systems and one Counter Languages. Theor. Comput. Sci. 22: 95-126 (1983) |
| 1980 | ||
| 3 | | Friedrich J. Urbanek: An O(log n) Algorithm for Computing the nth Element of the Solution of a Difference Equation. Inf. Process. Lett. 11(2): 66-67 (1980) |
| 1979 | ||
| 2 | | Werner Kuich, Helmut Prodinger, Friedrich J. Urbanek: On the Height of Derivation Trees. ICALP 1979: 370-384 |
| 1 | | Helmut Prodinger, Friedrich J. Urbanek: Language Operators Related to Init. Theor. Comput. Sci. 8: 161-175 (1979) |
| 1 | Gerd Baron | [7] |
| 2 | Werner Kuich | [2] [4] [13] |
| 3 | Helmut Prodinger | [1] [2] |
| 4 | Norbert Sauer (Norbert W. Sauer) | [13] |