BibTeX records: Friedrich J. Urbanek

download as .bib file

@article{DBLP:journals/jucs/KuichSU02,
  author       = {Werner Kuich and
                  Norbert Sauer and
                  Friedrich J. Urbanek},
  title        = {Heyting Algebras and Formal Languages},
  journal      = {J. Univers. Comput. Sci.},
  volume       = {8},
  number       = {7},
  pages        = {722},
  year         = {2002},
  url          = {https://doi.org/10.3217/jucs-008-07-0722},
  doi          = {10.3217/JUCS-008-07-0722},
  timestamp    = {Thu, 07 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jucs/KuichSU02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eatcs/Urbanek93,
  author       = {Friedrich J. Urbanek},
  title        = {A simple lamda-term representing the predecessor function with respect
                  to church numerials},
  journal      = {Bull. {EATCS}},
  volume       = {50},
  pages        = {276--279},
  year         = {1993},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eatcs/Urbanek93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eatcs/Urbanek92a,
  author       = {Friedrich J. Urbanek},
  title        = {O = square},
  journal      = {Bull. {EATCS}},
  volume       = {46},
  pages        = {186--187},
  year         = {1992},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eatcs/Urbanek92a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eatcs/Urbanek92,
  author       = {Friedrich J. Urbanek},
  title        = {A note on the language operator "red"},
  journal      = {Bull. {EATCS}},
  volume       = {47},
  pages        = {205--206},
  year         = {1992},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eatcs/Urbanek92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eatcs/Urbanek90,
  author       = {Friedrich J. Urbanek},
  title        = {A Simple Completeness Proof for Early's Algorithm},
  journal      = {Bull. {EATCS}},
  volume       = {42},
  pages        = {194},
  year         = {1990},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eatcs/Urbanek90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eatcs/Urbanek89,
  author       = {Friedrich J. Urbanek},
  title        = {On minimizing finite automata},
  journal      = {Bull. {EATCS}},
  volume       = {39},
  pages        = {205--206},
  year         = {1989},
  timestamp    = {Thu, 18 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eatcs/Urbanek89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/BaronU89,
  author       = {Gerd Baron and
                  Friedrich J. Urbanek},
  title        = {Factorial Languages with Quadratically Upper Bounded Growth Functions
                  and Nonlinearly Upper Bounded Subword Complexities},
  journal      = {Inf. Process. Lett.},
  volume       = {32},
  number       = {5},
  pages        = {267--269},
  year         = {1989},
  url          = {https://doi.org/10.1016/0020-0190(89)90055-0},
  doi          = {10.1016/0020-0190(89)90055-0},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/BaronU89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Urbanek86,
  author       = {Friedrich J. Urbanek},
  title        = {On Greibach Normal Form Construction},
  journal      = {Theor. Comput. Sci.},
  volume       = {44},
  pages        = {229--236},
  year         = {1986},
  url          = {https://doi.org/10.1016/0304-3975(86)90120-9},
  doi          = {10.1016/0304-3975(86)90120-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Urbanek86.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Urbanek85,
  author       = {Friedrich J. Urbanek},
  title        = {On Greibach Normal Form Construction},
  journal      = {Theor. Comput. Sci.},
  volume       = {40},
  pages        = {315--317},
  year         = {1985},
  url          = {https://doi.org/10.1016/0304-3975(85)90173-2},
  doi          = {10.1016/0304-3975(85)90173-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Urbanek85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/ProdingerU83,
  author       = {Helmut Prodinger and
                  Friedrich J. Urbanek},
  title        = {On monotone functions of tree structures},
  journal      = {Discret. Appl. Math.},
  volume       = {5},
  number       = {2},
  pages        = {223--239},
  year         = {1983},
  url          = {https://doi.org/10.1016/0166-218X(83)90043-4},
  doi          = {10.1016/0166-218X(83)90043-4},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ProdingerU83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KuichU83,
  author       = {Werner Kuich and
                  Friedrich J. Urbanek},
  title        = {Infinite Linear Systems and one Counter Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {22},
  pages        = {95--126},
  year         = {1983},
  url          = {https://doi.org/10.1016/0304-3975(83)90140-8},
  doi          = {10.1016/0304-3975(83)90140-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KuichU83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ipl/Urbanek80,
  author       = {Friedrich J. Urbanek},
  title        = {An O(log n) Algorithm for Computing the n\({}^{\mbox{th}}\) Element
                  of the Solution of a Difference Equation},
  journal      = {Inf. Process. Lett.},
  volume       = {11},
  number       = {2},
  pages        = {66--67},
  year         = {1980},
  url          = {https://doi.org/10.1016/0020-0190(80)90002-2},
  doi          = {10.1016/0020-0190(80)90002-2},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/Urbanek80.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ProdingerU79,
  author       = {Helmut Prodinger and
                  Friedrich J. Urbanek},
  title        = {Infinite 0-1-sequences without long adjacent identical blocks},
  journal      = {Discret. Math.},
  volume       = {28},
  number       = {3},
  pages        = {277--289},
  year         = {1979},
  url          = {https://doi.org/10.1016/0012-365X(79)90135-3},
  doi          = {10.1016/0012-365X(79)90135-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ProdingerU79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ProdingerU79,
  author       = {Helmut Prodinger and
                  Friedrich J. Urbanek},
  title        = {Language Operators Related to Init},
  journal      = {Theor. Comput. Sci.},
  volume       = {8},
  pages        = {161--175},
  year         = {1979},
  url          = {https://doi.org/10.1016/0304-3975(79)90042-2},
  doi          = {10.1016/0304-3975(79)90042-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ProdingerU79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/icalp/KuichPU79,
  author       = {Werner Kuich and
                  Helmut Prodinger and
                  Friedrich J. Urbanek},
  editor       = {Hermann A. Maurer},
  title        = {On the Height of Derivation Trees},
  booktitle    = {Automata, Languages and Programming, 6th Colloquium, Graz, Austria,
                  July 16-20, 1979, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {71},
  pages        = {370--384},
  publisher    = {Springer},
  year         = {1979},
  url          = {https://doi.org/10.1007/3-540-09510-1\_30},
  doi          = {10.1007/3-540-09510-1\_30},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/KuichPU79.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.