Paul E. Schupp

发表

Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity

David E. Muller, Ahmed Saoudi, Paul E. Schupp, 1986, ICALP.

Computational complexity and the conjugacy problem

Paul E. Schupp, Alexei G. Myasnikov, 2017, Comput..

Generic computability, Turing degrees, and asymptotic density

Paul E. Schupp, Carl G. Jockusch, C. Jockusch, 2010, J. Lond. Math. Soc..

Sur les Monoides À un Relateur qui sont des Groupes

Paul E. Schupp, Dominique Perrin, 1984, Theor. Comput. Sci..

Average-case complexity and decision problems in group theory

Ilya Kapovich, Paul E. Schupp, Alexei G. Myasnikov, 2002, ArXiv.

Asymptotic density and computably Enumerable Sets

Paul E. Schupp, Rodney G. Downey, Carl G. Jockusch, 2013, J. Math. Log..

Alternating automata on infinite objects, determinacy and Rabin's theorem

David E. Muller, Paul E. Schupp, D. E. Muller, 1984, Automata on Infinite Words.

Alternating Automata on Infinite Trees

David E. Muller, Paul E. Schupp, 1987, Theor. Comput. Sci..

Alternating Automata, the Weak Monadic Theory of Trees and its Complexity

David E. Muller, Ahmed Saoudi, Paul E. Schupp, 1992, Theor. Comput. Sci..

Multidimensional Systems Theory and Applications

Paul E. Schupp, Roger C. Lyndon, Roger C. Lyndon, 1977 .

Groups, graphs, languages, automata, games and second-order monadic logic

Paul E. Schupp, Tullio Ceccherini-Silberstein, Michel Coornaert, 2012, Eur. J. Comb..

Generic-case complexity, decision problems in group theory and random walks

Ilya Kapovich, Paul E. Schupp, Alexei G. Myasnikov, 2002, ArXiv.

Asymptotic density and the coarse computability bound

Paul E. Schupp, Denis R. Hirschfeldt, Carl G. Jockusch, 2015, Comput..

On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order Theory

David E. Muller, Ahmed Saoudi, Paul E. Schupp, 1992, ICCI.

Arrays, Automata and Groups: Some Interconnections

Paul E. Schupp, 1986, Automata Networks.

Finite State Processes, Z-Temporal Logic and the Monadic Theory of the Integers

David E. Muller, Ahmed Saoudi, Paul E. Schupp, 1992, Int. J. Found. Comput. Sci..

Membership Problem for the Modular Group

Paul E. Schupp, Yuri Gurevich, Y. Gurevich, 2007, SIAM J. Comput..

Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories

Paul E. Schupp, Dominique Perrin, 1986, LICS.

Asymptotic Density and the Theory of Computability: A Partial Survey

Paul E. Schupp, Carl G. Jockusch, C. Jockusch, 2016, Computability and Complexity.

Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra

David E. Muller, Paul E. Schupp, D. E. Muller, 1995, Theor. Comput. Sci..

Asymptotic density and the Ershov hierarchy

Paul E. Schupp, Rodney G. Downey, Carl G. Jockusch, 2013, Math. Log. Q..

Generic properties of Whitehead's Algorithm, stabilizers in Aut(Fk) and one-relator groups

Ilya Kapovich, Paul E. Schupp, Vladimir Shpilrain, 2003, ArXiv.

Pushdown automata, graphs, ends, second-order logic, and reachability problems

David E. Muller, Paul E. Schupp, 1981, STOC '81.

On the Complexity of omega-Tree Sets and Nerode Theorem

David E. Muller, Ahmed Saoudi, Paul E. Schupp, 1990, Int. J. Found. Comput. Sci..

Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time

David E. Muller, Ahmed Saoudi, Paul E. Schupp, 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

Multipass automata and group word problems pdf

Paul E. Schupp, Michel Coornaert, Francesca Fiorenzi, 2014, Theor. Comput. Sci..

Groups, the Theory of Ends, and Context-Free Languages

David E. Muller, Paul E. Schupp, D. E. Muller, 1983, J. Comput. Syst. Sci..

COARSE REDUCIBILITY AND ALGORITHMIC RANDOMNESS

Paul E. Schupp, Denis R. Hirschfeldt, Carl G. Jockusch, 2015, The Journal of Symbolic Logic.

Some Quantitative Aspects of Fractional Computability pdf

Ilya Kapovich, Paul E. Schupp, P. Schupp, 2007, ArXiv.

The Theory of Ends, Pushdown Automata, and Second-Order Logic

David E. Muller, Paul E. Schupp, D. E. Muller, 1985, Theor. Comput. Sci..

On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular Group

Paul E. Schupp, 1998, Theor. Comput. Sci..

Coarse computability, the density metric, hausdorff distances between turing degrees, perfect trees, and reverse mathematics

Paul E. Schupp, Denis R. Hirschfeldt, Carl G. Jockusch, 2021, Journal of Mathematical Logic.

Embeddings into Simple Groups

Paul E. Schupp, P. Schupp, 1976 .

Groups and graphs

Paul E. Schupp, 1979 .

A Survey of Small Cancellation Theory

Paul E. Schupp, P. Schupp, 1973 .

Embeddings into hopfian groups

Paul E. Schupp, Charles F. Miller, 1971 .

Context-free languages, groups, the theory of ends, second-order logic, tiling problems, cellular automata, and vector addition systems

David E. Muller, Paul E. Schupp, 1981 .

On Dehn's algorithm and the conjugacy problem

Paul E. Schupp, P. Schupp, 1968 .

Contributions to group theory

Paul E. Schupp, Kenneth I. Appel, John G. Ratcliffe, 1984 .

Coxeter Groups, 2-Completion, Perimeter Reduction and Subgroup Separability

Paul E. Schupp, 2002 .