The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Wolfgang Thomas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wolfgang Thomas
    Logical Aspects in the Study of Tree Languages. [Citation Graph (1, 0)][DBLP]
    CAAP, 1984, pp:31-50 [Conf]
  2. Wolfgang Thomas
    On Chain Logic, Path Logic, and First-Order Logic over Infinite Trees [Citation Graph (1, 0)][DBLP]
    LICS, 1987, pp:245-256 [Conf]
  3. Wolfgang Thomas
    A Combinatorial Approach to the Theory of omega-Automata [Citation Graph (1, 0)][DBLP]
    Information and Control, 1981, v:48, n:3, pp:261-283 [Journal]
  4. Wolfgang Thomas
    Classifying Regular Events in Symbolic Logic. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:3, pp:360-376 [Journal]
  5. Wolfgang Thomas
    Some Perspectives of Infinite-State Verification. [Citation Graph (0, 0)][DBLP]
    ATVA, 2005, pp:3-10 [Conf]
  6. Wolfgang Thomas
    A Concatenation Game and the Dot-Depth Hierarchy. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:415-426 [Conf]
  7. Wolfgang Thomas
    Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words. [Citation Graph (0, 0)][DBLP]
    Structures in Logic and Computer Science, 1997, pp:118-143 [Conf]
  8. Wolfgang Thomas
    Complementation of Büchi Automata Revised. [Citation Graph (0, 0)][DBLP]
    Jewels are Forever, 1999, pp:109-120 [Conf]
  9. Wolfgang Thomas
    Infinite Games and Verification (Extended Abstract of a Tutorial). [Citation Graph (0, 0)][DBLP]
    CAV, 2002, pp:58-64 [Conf]
  10. Thierry Cachat, Jacques Duparc, Wolfgang Thomas
    Solving Pushdown Games with a Sigma3 Winning Condition. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:322-336 [Conf]
  11. Alexander Moshe Rabinovich, Wolfgang Thomas
    Decidable Theories of the Ordering of Natural Numbers with Unary Predicates. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:562-574 [Conf]
  12. Henry A. Kautz, Wolfgang Thomas, Moshe Y. Vardi
    05241 Executive Summary - Synthesis and Planning. [Citation Graph (0, 0)][DBLP]
    Synthesis and Planning, 2005, pp:- [Conf]
  13. Henry A. Kautz, Wolfgang Thomas, Moshe Y. Vardi
    05241 Abstracts Collection - Synthesis and Planning. [Citation Graph (0, 0)][DBLP]
    Synthesis and Planning, 2005, pp:- [Conf]
  14. Kurt Mehlhorn, Volker Claus, Wolfgang Thomas
    Komplexitätstheorie und Algorithmik. [Citation Graph (0, 0)][DBLP]
    Perspektiven der Informatik, 1993, pp:113-116 [Conf]
  15. Wolfgang Thomas
    Logic for Computer Science: The Engineering Challenge. [Citation Graph (0, 0)][DBLP]
    Informatics, 2001, pp:257-267 [Conf]
  16. Wolfgang Thomas
    Logik in der Informatik. [Citation Graph (0, 0)][DBLP]
    Perspektiven der Informatik, 1993, pp:116-120 [Conf]
  17. Wolfgang Thomas
    Semantik und Verifikation. [Citation Graph (0, 0)][DBLP]
    Perspektiven der Informatik, 1993, pp:120-124 [Conf]
  18. Wolfgang Thomas, Julien Cristau, Christof Löding
    Deterministic Automata on Unranked Trees. [Citation Graph (0, 0)][DBLP]
    Foundations of Semistructured Data, 2005, pp:- [Conf]
  19. Philipp Rohde, Wolfgang Thomas
    Ein e-Lecture-System für die Theoretische Informatik. [Citation Graph (0, 0)][DBLP]
    DeLFI, 2003, pp:17-26 [Conf]
  20. Jan-Henrik Altenbernd, Wolfgang Thomas, Stefan Wöhrle
    Tiling Systems over Infinite Pictures and Their Acceptance Conditions. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:297-306 [Conf]
  21. Eija Jurvanen, Andreas Potthoff, Wolfgang Thomas
    Tree Languages Recognizable by Regular Frontier Check. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1993, pp:3-17 [Conf]
  22. Ina Schiering, Wolfgang Thomas
    Counter-Free Automata, First-Order Logic and Star-Free Expressions. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:166-175 [Conf]
  23. Wolfgang Thomas
    A Short Introduction to Infinite Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:130-144 [Conf]
  24. Nils Buhrke, Wolfgang Thomas, Jens Vöge
    Ein inkrementeller Ansatz zur effizienten Synthese von Controllern aus Spezifikationen mit temporaler Logik. [Citation Graph (0, 0)][DBLP]
    FBT, 1997, pp:99-108 [Conf]
  25. Julien Cristau, Christof Löding, Wolfgang Thomas
    Deterministic Automata on Unranked Trees. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:68-79 [Conf]
  26. Andreas Potthoff, Wolfgang Thomas
    Regular Tree Languages Without Unary Symbols are Star-Free. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:396-405 [Conf]
  27. Wolfgang Thomas
    Finite-State Strategies in Regular Infinite Games. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:149-158 [Conf]
  28. Thilo Hafer, Wolfgang Thomas
    Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:269-279 [Conf]
  29. Wong Karianto, Aloys Krieg, Wolfgang Thomas
    On Intersection Problems for Polynomially Generated Sets. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:516-527 [Conf]
  30. Howard Straubing, Denis Thérien, Wolfgang Thomas
    regular Languages Defined with Generalized Quantifiers. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:561-575 [Conf]
  31. Wolfgang Thomas
    On Logics, Tilings, and Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:441-454 [Conf]
  32. Wolfgang Thomas
    Finite-State Recognizability and Logic: from Words to Graphs. [Citation Graph (0, 0)][DBLP]
    IFIP Congress (1), 1994, pp:499-506 [Conf]
  33. Christof Löding, Wolfgang Thomas
    Alternating Automata and Logics over Infinite Words. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:521-535 [Conf]
  34. Oliver Matz, Wolfgang Thomas
    The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite. [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:236-244 [Conf]
  35. Wolfgang Thomas
    The Engineering Challenge for Logic. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:- [Conf]
  36. Wolfgang Thomas
    Monadic Logic and Automata: Recent Developments. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:136-138 [Conf]
  37. Stefan Wöhrle, Wolfgang Thomas
    Model Checking Synchronized Products of Infinite Transition Systems. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:2-11 [Conf]
  38. Wolfgang Thomas
    Automata and quantifier hierarchies. [Citation Graph (0, 0)][DBLP]
    Formal Properties of Finite Automata and Applications, 1988, pp:104-119 [Conf]
  39. Olivier Carton, Wolfgang Thomas
    The Monadic Theory of Morphic Infinite Words and Generalizations. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:275-284 [Conf]
  40. Wolfgang Thomas
    Constructing Infinite Graphs with a Decidable MSO-Theory. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:113-124 [Conf]
  41. Wolfgang Thomas
    Computation tree logic and regular omega-languages. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1988, pp:690-713 [Conf]
  42. Wolfgang Thomas, Helmut Lescow
    Logical Specifications of Infinite Computations. [Citation Graph (0, 0)][DBLP]
    REX School/Symposium, 1993, pp:583-621 [Conf]
  43. Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas
    Monadic Second-Order Logic Over Pictures and Recognizability by Tiling Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:365-375 [Conf]
  44. V. Kell, Albert Maier, Andreas Potthoff, Wolfgang Thomas, U. Wermuth
    AMORE: A System for Computing Automata, MOnoidsm and Regular Expressions. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:537-538 [Conf]
  45. Wolfgang Thomas
    Infinite Trees and Automaton Definable Relations over Omega-Words. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:263-277 [Conf]
  46. Wolfgang Thomas
    On the Synthesis of Strategies in Infinite Games. [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:1-13 [Conf]
  47. Wolfgang Thomas
    On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:559-568 [Conf]
  48. Wolfgang Thomas
    Automata Theory on Trees and Partial Orders. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:20-38 [Conf]
  49. Wolfgang Thomas
    A hierarchy of sets of infinite trees. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1983, pp:335-342 [Conf]
  50. Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier
    Observations on Determinization of Büchi Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2005, pp:262-272 [Conf]
  51. Nico Wallmeier, Patrick Hütten, Wolfgang Thomas
    Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications. [Citation Graph (0, 0)][DBLP]
    CIAA, 2003, pp:11-22 [Conf]
  52. Olivier Carton, Wolfgang Thomas
    The Monadic Theory of Morphic Infinite Words and Generalizations. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:176, n:1, pp:51-65 [Journal]
  53. Dora Giammarresi, Antonio Restivo, Sebastian Seibert, Wolfgang Thomas
    Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:125, n:1, pp:32-45 [Journal]
  54. Oliver Matz, Nicole Schweikardt, Wolfgang Thomas
    The Monadic Quantifier Alternation Hierarchy over Grids and Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:179, n:2, pp:356-383 [Journal]
  55. Howard Straubing, Denis Thérien, Wolfgang Thomas
    Regular Languages Defined with Generalized Quanifiers [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:2, pp:289-301 [Journal]
  56. Wolfgang Thomas
    Star-Free Regular Sets of omega-Sequences [Citation Graph (0, 0)][DBLP]
    Information and Control, 1979, v:42, n:2, pp:148-156 [Journal]
  57. Wolfgang Thomas
    On Frontiers of Regular Trees. [Citation Graph (0, 0)][DBLP]
    ITA, 1986, v:20, n:4, pp:371-381 [Journal]
  58. Walter Oberschelp, Britta Schinzel, Wolfgang Thomas, Michael M. Richter
    European Summer Meeting of the Association for Symbolic Logic: Aachen, 1983. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1985, v:50, n:1, pp:259-283 [Journal]
  59. Wolfgang Thomas
    On the Bounded Monadic Theory of Well-Ordered Structures. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1980, v:45, n:2, pp:334-338 [Journal]
  60. Christoph Schulte Althoff, Wolfgang Thomas, Nico Wallmeier
    Observations on determinization of Büchi automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:363, n:2, pp:224-233 [Journal]
  61. Wolfgang Thomas
    Uniform and nonuniform recognizability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:299-316 [Journal]
  62. Wolfgang Thomas
    Remark on the Star-Height-Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:13, n:, pp:231-237 [Journal]
  63. Wolfgang Thomas
    Infinite Trees and Automation-Definable Relations over omega-Words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:103, n:1, pp:143-159 [Journal]
  64. Alexander Rabinovich, Wolfgang Thomas
    Logical Refinements of Church's Problem. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:69-83 [Conf]
  65. Stefan Wöhrle, Wolfgang Thomas
    Model Checking Synchronized Products of Infinite Transition Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  66. Optimal Strategy Synthesis in Request-Response Games. [Citation Graph (, )][DBLP]


  67. Church's Problem and a Tour through Automata Theory. [Citation Graph (, )][DBLP]


  68. On Monadic Theories of Monadic Predicates. [Citation Graph (, )][DBLP]


  69. Model Transformations in Decidability Proofs for Monadic Theories. [Citation Graph (, )][DBLP]


  70. The Reachability Problem over Infinite Graphs. [Citation Graph (, )][DBLP]


  71. Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies. [Citation Graph (, )][DBLP]


  72. Facets of Synthesis: Revisiting Church's Problem. [Citation Graph (, )][DBLP]


  73. Degrees of Lookahead in Regular Infinite Games. [Citation Graph (, )][DBLP]


  74. Optimizing Winning Strategies in Regular Infinite Games. [Citation Graph (, )][DBLP]


  75. The Complexity of Reachability in Randomized Sabotage Games. [Citation Graph (, )][DBLP]


  76. The role of pseudo-wires for layer 2 services in intelligent transport networks. [Citation Graph (, )][DBLP]


  77. A Game Theoretic Approach to the Analysis of Dynamic Networks. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.454secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002