( en | de | ru )

 

Disambiguation of "Walukiewicz, Igor"

Author of the publication

copydeleteadd this publication to your clipboard
Deciding the Topological Complexity of Büchi Languages.

, and . ICALP, volume 55 of LIPIcs, page 99:1-99:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

Igor Barabash

Das Bildzitat im Internet. Uni München, (2009)

Igor Semechin

Igor Kasko

Igor Herrmann

Igor Zlokarnik

 

Other publications of authors with the same name

Local Logics for Traces.. Journal of Automata, Languages and Combinatorics, 7 (2): 259-290 (2002)Automata and Games for Synthesis.. AMAST, volume 2422 of Lecture Notes in Computer Science, page 15-20. Springer, (2002)Third-Order Idealized Algol with Iteration Is Decidable., and . FoSSaCS, volume 3441 of Lecture Notes in Computer Science, page 202-218. Springer, (2005)Relating Hierarchies of Word and Tree Automata., and . STACS, volume 1373 of Lecture Notes in Computer Science, page 320-331. Springer, (1998)Unsafe Grammars and Panic Automata., , , and . ICALP, volume 3580 of Lecture Notes in Computer Science, page 1450-1461. Springer, (2005)Krivine Machines and Higher-Order Schemes., and . ICALP (2), volume 6756 of Lecture Notes in Computer Science, page 162-173. Springer, (2011)Automata theory and higher-order model-checking.. ACM SIGLOG News, 3 (4): 13-31 (2016)Abstraction-based control synthesis using partial information., , , , and . Eur. J. Control, (2022)Efficient emptiness check for timed Büchi automata., , and . Formal Methods Syst. Des., 40 (2): 122-146 (2012)Third-order Idealized Algol with iteration is decidable., and . Theor. Comput. Sci., 390 (2-3): 214-229 (2008)