( en | de | ru )

 

Disambiguation of "Schupp, Paul E."

Author of the publication

copydeleteadd this publication to your clipboard
Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity.

, , and . ICALP, volume 226 of Lecture Notes in Computer Science, page 275-283. Springer, (1986)

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.

Paul Schupp

Paul E Logan

Ernst Schupp

Hellmuth Schupp

Alfons Schupp

 

Other publications of authors with the same name

Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity., , and . ICALP, volume 226 of Lecture Notes in Computer Science, page 275-283. Springer, (1986)Some Quantitative Aspects of Fractional Computability, and . CoRR, (2007)Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematics., , and . J. Math. Log., 24 (2): 2350005:1-2350005:76 (August 2024)Arrays, Automata and Groups: Some Interconnections.. Automata Networks, volume 316 of Lecture Notes in Computer Science, page 19-28. Springer, (1986)Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time, , and . LICS, page 422-427. IEEE Computer Society, (1988)Asymptotic density and computably Enumerable Sets., , and . J. Math. Log., 13 (2): 1350005 (2013)Generic properties of Whitehead's Algorithm, stabilizers in Aut(Fk) and one-relator groups, , and . CoRR, (2003)On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory., , and . ICCI, page 2-5. IEEE Computer Society, (1992)Asymptotic Density and the Theory of Computability: A Partial Survey., and . Computability and Complexity, volume 10010 of Lecture Notes in Computer Science, page 501-520. Springer, (2017)Computational complexity and the conjugacy problem., and . Comput., 6 (4): 307-318 (2017)