Prof. Dr. Helmut Seidl

Publications in Conferences before 1994:

• When Is a Functional Tree Transduction Deterministic?
  Helmut Seidl
  Proc. TAPSOFT'93, LNCS 668, 251-265, 1993
• Tree Automata with Cost Functions.
  Helmut Seidl
  Proc. CAAP'92, LNCS 581, 279-299, 1992
• FORK - A High Level Language for PRAMs.
  Torben Hagerup, Arno Schmitt and Helmut Seidl
  Proc. PARLE'91, LNCS 505, 304-320, 1991
• Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions, part II.
  Andreas Goerdt and Helmut Seidl.
  6th Meeting of Young Computer Scientists, LNCS 464, 148-158, 1990
• Single-Valuedness of Bottom-up Finite State Tree Transducers Is Decidable in Polynomial Time.
  Helmut Seidl.
  Proc. of Toyohashi Symposium on Theoretical Computer Science, Aug. 30 - Sept. 1, 69-73, 1990
• Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable.
  Helmut Seidl.
  Proc. CAAP'90, LNCS 431, 269-284
• Probabilistic Load Balancing for Parallel Graph Reduction.
  Helmut Seidl and Reinhard Wilhelm.
  Proc. 4th Region 10 Conference, Bombay Nov. 1989, 879-884
• On the Finite Degree of Ambiguity of Finite Tree Automata.
  Helmut Seidl
  Proc. FCT'89, LNCS 380, 395-404, 1989
• Deciding Equivalence of Finite Tree Automata.
  Helmut Seidl.
  Proc. STACS'89, LNCS 349, 480-492, 1989
• Parameter-Reduction of Higher Level Grammars.
  Helmut Seidl.
  Proc. CAAP '88, LNCS 299, 52-71, 1988
• On the Degree of Ambiguity of Finite Automata.
  Andreas Weber, Helmut Seidl.
  Proc. MFCS '86, LNCS 233, 620-629, 1986
• A Quadratic Regularity Test for Non-Deleting Macro S Grammars.
  Helmut Seidl.
  Proc. FCT '85, LNCS 199, 422-430, 1985