Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Friedrich J. Urbanek
Observed names:
F Urbanek,
F. J. Urbanek,
F.J. Urbanek,
Friedrich Urbanek
Institution:
TU Wien
Observed institution:
TU Wien
OpenAlex ID:
A5042746476
On monotone functions of tree structures
1983
·
Helmut Prodinger
, Friedrich J. Urbanek
·
Discrete Applied Mathematics
·
32
Infinite 0–1-sequences without long adjacent identical blocks
1979
·
Helmut Prodinger
, Friedrich J. Urbanek
·
Discrete Mathematics
·
30
An O(log n) algorithm for computing the nth element of the solution of a difference equation
1980
·
Friedrich J. Urbanek
·
Information Processing Letters
·
23
Infinite linear systems and one counter languages
1983
·
W. Kuich
, F.J. Urbanek
·
Theoretical Computer Science
·
13
On Greibach normal form construction
1986
·
Friedrich J. Urbanek
·
Theoretical Computer Science
·
9
PDF
On greibach normal form construction
1985
·
Friedrich J. Urbanek
·
Theoretical Computer Science
·
9
On the height of derivation trees
1979
·
Werner Kuich
, Helmut Prodinger
, et al.
·
Lecture notes in computer science
·
8
Language operators related to Init
1979
·
Helmut Prodinger
, Friedrich J. Urbanek
·
Theoretical Computer Science
·
7
On minimizing finite automata.
1989
·
Friedrich J. Urbanek
·
Bulletin of the European Association for Theoretical Computer Science
·
4
Heyting Algebras and Formal Languages
2002
·
Werner Kuich
, Technische Universität Wien
, et al.
·
Zenodo (CERN European Organization for Nuclear Research)
·
2
PDF
A simple lamda-term representing the predecessor function with respect to church numerials.
1993
·
Friedrich J. Urbanek
·
Bulletin of the European Association for Theoretical Computer Science
·
1
Heyting Algebras and Formal Languages
2020
·
Friedrich Urbanek
, Norbert Sauer
, et al.
·
TUGraz OPEN Library (Graz University of Technology)
A note on the language operator "red".
1992
·
Friedrich J. Urbanek
·
Bulletin of the European Association for Theoretical Computer Science
A Simple Completeness Proof for Early's Algorithm.
1990
·
Friedrich J. Urbanek
·
Bulletin of the European Association for Theoretical Computer Science
Factorial languages with quadratically upper bounded growth functions and nonlinearly upper bounded subword complexities
1989
·
Gerd Baron
, Friedrich Urbanek
·
Information Processing Letters
On greibach normal form construction
1985
·
F Urbanek
·
Theoretical Computer Science
PDF
- O-l-SEQUENCES WITHOUT LONG ADJACENT IDENTICAL BLOCKS
1979
·
Helmut Prodinger
, Friedrich J. Urbanek
Buchbesprechungen
1975
·
J. Hertling
, W. Kuich
, et al.
·
Computing
Buchbesprechungen
1975
·
H. Lorez
, F. J. Urbanek
, et al.
·
Computing
Buchbesprechungen
1974
·
W. Barth
, F. J. Urbanek
, et al.
·
Computing
Show more works
View as search
Works count:
20
Citation count:
138
H-index:
7
I10-index:
4
Year
Topic
Type
