( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables.

, и . Inf. Comput., 153 (1): 47-80 (1999)

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.

Jean Paul

Christian Paul

Daniela Paul

Georg Paula

Carsten Paulus

 

Другие публикации лиц с тем же именем

Local Temporal Logic is Expressively Complete for Cograph Dependence Alphabets., и . LPAR, том 2250 из Lecture Notes in Computer Science, стр. 55-69. Springer, (2001)Editorial., и . Journal of Automata, Languages and Combinatorics, 7 (2): 165 (2002)Intersection of Regular Signal-Event (Timed) Languages., , и . FORMATS, том 4202 из Lecture Notes in Computer Science, стр. 52-66. Springer, (2006)Asynchronous Cellular Automata for Pomsets Without Auto-concurrency., и . CONCUR, том 1119 из Lecture Notes in Computer Science, стр. 627-638. Springer, (1996)Avoiding State Explosion for Distributed Systems with Timestamps., , и . FME, том 2021 из Lecture Notes in Computer Science, стр. 119-134. Springer, (2001)On Recognizable and Rational Formal Power Series in Partially Commuting Variables., и . ICALP, том 1256 из Lecture Notes in Computer Science, стр. 682-692. Springer, (1997)Weighted Automata and Weighted Logics., и . ICALP, том 3580 из Lecture Notes in Computer Science, стр. 513-525. Springer, (2005)Recognizable Complex Trace Languages., , и . MFCS, том 520 из Lecture Notes in Computer Science, стр. 131-140. Springer, (1991)Fast Algorithms for Handling Diagonal Constraints in Timed Automata., , и . CAV (1), том 11561 из Lecture Notes in Computer Science, стр. 41-59. Springer, (2019)Analyzing Timed Systems Using Tree Automata., , и . Log. Methods Comput. Sci., (2018)