( en | de | ru )

 

Disambiguation of "Paranthoën, Thomas"

Author of the publication

copydeleteadd this publication to your clipboard
Brute Force Determinization of NFAs by Means of State Covers.

, , and . CIAA, volume 3317 of Lecture Notes in Computer Science, page 80-89. Springer, (2004)

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.

Thomas Thomas

Thomas Baron

Untersuchungen an ungeschädigten und durch Pilzbefall geschädigten Nadelholzbauteilen mit ausgewählten Prüfverfahren. TU Dresden, (2009)

Thomas Harasim

Die Rolle des nucleostemin-Gens in dem Prozess der Ribosomenbiogenese. Uni München, (2009)

Thomas Böttcher

Naturstoffe und ihre Derivate als molekulare Sonden: Identifikation ihrer Angriffsziele und Inhibition der Virulenz in pathogenen Bakterien. Uni München, (2009)

Thomas Potinecke

Methode zur Systematisierung von Teilprozessen in der Produktentwicklung beim Einsatz von CAx-Technologien. Uni Stuttgart, (2009)
 

Other publications of authors with the same name

NFAs bitstream-based random generation., , , and . DCFS, Report No. 586, page 81-94. Department of Computer Science, The University of Western Ontario, Canada, (2002)Brute Force Determinization of NFAs by Means of State Covers., , and . CIAA, volume 3317 of Lecture Notes in Computer Science, page 80-89. Springer, (2004)Brute force determinization of nfas by means of state covers., , and . Int. J. Found. Comput. Sci., 16 (3): 441-451 (2005)Random Generation Models for NFAs., , , and . Journal of Automata, Languages and Combinatorics, 9 (2/3): 203-216 (2004)Compact and fast algorithms for safe regular expression search., , and . Int. J. Comput. Math., 81 (4): 383-401 (2004)Random DFAs over a Non-Unary Alphabet., and . DCFS, page 90-101. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary, (2003)Random generation of DFAs., and . Theor. Comput. Sci., 330 (2): 221-235 (2005)Split and join for minimizing: Brzozowski's algorithm., , and . Stringology, page 96-104. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2002)