Paul E. Schupp

Publication Activity (10 Years)

Years Active: 1981-2017
Publications (10 Years): 6

Top Topics

Formal Languages

Finite State Automata

Laplace Transform

Top Venues

J. Lond. Math. Soc.

Publications

Carl G. Jockusch Jr., Paul E. Schupp
Asymptotic Density and the Theory of Computability: A Partial Survey. Computability and Complexity (2017)
Alexei Miasnikov, Paul E. Schupp
Computational complexity and the conjugacy problem. Comput. 6 (4) (2017)
Denis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp
Asymptotic density and the coarse computability bound. Comput. 5 (1) (2016)
Denis R. Hirschfeldt, Carl G. Jockusch Jr., Rutger Kuyper, Paul E. Schupp
Coarse Reducibility and Algorithmic Randomness. J. Symb. Log. 81 (3) (2016)
Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp
Asymptotic density and the Ershov hierarchy. Math. Log. Q. 61 (3) (2015)
Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp, Nicholas W. M. Touikan
Multipass automata and group word problems. Theor. Comput. Sci. 600 (2015)
Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp
Multipass automata and group word problems. CoRR (2014)
Rodney G. Downey, Carl G. Jockusch Jr., Paul E. Schupp
Asymptotic density and computably Enumerable Sets. J. Math. Log. 13 (2) (2013)
Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp
Groups, Graphs, Languages, Automata, Games and Second-order Monadic Logic CoRR (2012)
Tullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp
Groups, graphs, languages, automata, games and second-order monadic logic. Eur. J. Comb. 33 (7) (2012)
Carl G. Jockusch Jr., Paul E. Schupp
Generic computability, Turing degrees, and asymptotic density. J. Lond. Math. Soc. 85 (2) (2012)
Yuri Gurevich, Paul E. Schupp
Membership Problem for the Modular Group. SIAM J. Comput. 37 (2) (2007)
Ilya Kapovich, Paul E. Schupp
Some Quantitative Aspects of Fractional Computability CoRR (2007)
Ilya Kapovich, Paul E. Schupp, Vladimir Shpilrain
) and one-relator groups CoRR (2003)
Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain
Generic-case complexity, decision problems in group theory and random walks CoRR (2002)
Ilya Kapovich, Alexei G. Myasnikov, Paul E. Schupp, Vladimir Shpilrain
Average-case complexity and decision problems in group theory CoRR (2002)
Paul E. Schupp
On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular Group. Theor. Comput. Sci. 204 (1-2) (1998)
David E. Muller, Paul E. Schupp
Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra. Theor. Comput. Sci. 141 (1&2) (1995)
Ahmed Saoudi, David E. Muller, Paul E. Schupp
Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers. Int. J. Found. Comput. Sci. 3 (3) (1992)
David E. Muller, Paul E. Schupp, Ahmed Saoudi
On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory. ICCI (1992)
David E. Muller, Ahmed Saoudi, Paul E. Schupp
Alternating Automata, the Weak Monadic Theory of Trees and its Complexity. Theor. Comput. Sci. 97 (2) (1992)
Ahmed Saoudi, David E. Muller, Paul E. Schupp
On the Complexity of omega-Tree Sets and Nerode Theorem. Int. J. Found. Comput. Sci. 1 (1) (1990)
David E. Muller, Ahmed Saoudi, Paul E. Schupp
Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time LICS (1988)
David E. Muller, Paul E. Schupp
Alternating Automata on Infinite Trees. Theor. Comput. Sci. 54 (1987)
Dominique Perrin, Paul E. Schupp
Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories LICS (1986)
David E. Muller, Ahmed Saoudi, Paul E. Schupp
Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity. ICALP (1986)
Paul E. Schupp
Arrays, Automata and Groups: Some Interconnections. Automata Networks (1986)
David E. Muller, Paul E. Schupp
The Theory of Ends, Pushdown Automata, and Second-Order Logic. Theor. Comput. Sci. 37 (1985)
Dominique Perrin, Paul E. Schupp
Sur les Monoides À un Relateur qui sont des Groupes. Theor. Comput. Sci. 33 (1984)
David E. Muller, Paul E. Schupp
Alternating automata on infinite objects, determinacy and Rabin's theorem. Automata on Infinite Words (1984)
David E. Muller, Paul E. Schupp
Groups, the Theory of Ends, and Context-Free Languages. J. Comput. Syst. Sci. 26 (3) (1983)
David E. Muller, Paul E. Schupp
Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems STOC (1981)