( en | de | ru )

 

Disambiguation of "Seidl, Helmut"

Author of the publication

copydeleteadd this publication to your clipboard
Computing the longest common prefix of a context-free language in polynomial time.

, , and . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Helmut Seidl

Helmut Seidl

Helmut Seidl

Helmut Seidl

Helmut Seidl

 

Other publications of authors with the same name

Parameter-Reduction of Higher Level Grammars (Extended Abstract).. CAAP, volume 299 of Lecture Notes in Computer Science, page 52-71. Springer, (1988)Equivalence of Finite-Valued Bottom-up Finite State Tree Transducers Is Decidable.. CAAP, volume 431 of Lecture Notes in Computer Science, page 269-284. Springer, (1990)On the Balancedness of Tree-to-Word Transducers., , and . DLT, volume 12086 of Lecture Notes in Computer Science, page 222-236. Springer, (2020)Transparent teleteaching., and . ASCILITE, page 749-758. UNITEC Institute of Technology, Auckland, New Zealand, (2002)Clustered Relational Thread-Modular Abstract Interpretation with Local Traces., , , , and . ESOP, volume 13990 of Lecture Notes in Computer Science, page 28-58. Springer, (2023)Games through Nested Fixpoints., and . CAV, volume 5643 of Lecture Notes in Computer Science, page 291-305. Springer, (2009)Stratified Guarded First-Order Transition Systems., and . SAS, volume 12389 of Lecture Notes in Computer Science, page 113-133. Springer, (2020)When Long Jumps Fall Short: Control-Flow Tracking and Misuse Detection for Non-local Jumps in C., , , , and . SOAP@PLDI, page 20-26. ACM, (2023)Earliest Normal Form and Minimization for Bottom-up Tree Transducers., , and . Int. J. Found. Comput. Sci., 22 (7): 1607-1623 (2011)A Note on Karr's algorithm, and . Proc. Intl. Conference on Automata, Languages and Programming (ICALP), volume 3142 of LNCS, page 1016--1028. (2004)