Paul E. Schupp - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 25 from 25

2024

Coarse computability, the density metric, Hausdorff distances between Turing degrees, perfect trees, and reverse mathematicsDenis R. Hirschfeldt, Carl G. Jockusch Jr., Paul E. Schupp. jml, 24(2), August 2024. [doi]

2017

Asymptotic Density and the Theory of Computability: A Partial SurveyCarl G. Jockusch Jr., Paul E. Schupp. BIRTHDAY 2017: 501-520 [doi]

2016

Coarse Reducibility and Algorithmic RandomnessDenis R. Hirschfeldt, Carl G. Jockusch Jr., Rutger Kuyper, Paul E. Schupp. JSYML, 81(3):1028-1046, 2016. [doi]

Asymptotic density and the coarse computability boundDenis R. Hirschfeldt, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp. computability, 5(1):13-27, 2016. [doi]

2015

Multipass automata and group word problemsTullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp, Nicholas W. M. Touikan. TCS, 600:19-33, 2015. [doi]

Asymptotic density and the Ershov hierarchyRod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp. mlq, 61(3):189-195, 2015. [doi]

2013

Asymptotic density and computably Enumerable SetsRodney G. Downey, Carl G. Jockusch Jr., Paul E. Schupp. jml, 13(2):1350005, 2013. [doi]

2012

Groups, graphs, languages, automata, games and second-order monadic logicTullio Ceccherini-Silberstein, Michel Coornaert, Francesca Fiorenzi, Paul E. Schupp. ejc, 33(7):1330-1368, 2012. [doi]

Generic computability, Turing degrees, and asymptotic densityCarl G. Jockusch Jr., Paul E. Schupp. jlms, 85(2):472-490, 2012. [doi]

1998

On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular GroupPaul E. Schupp. TCS, 204(1-2):233-248, 1998. [doi]

1995

Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and SafraDavid E. Muller, Paul E. Schupp. TCS, 141(1&2):69-107, 1995. [doi]

1992

On the Decidability of the Linear Z-Temporal Logic and the Monadic Second Order TheoryDavid E. Muller, Paul E. Schupp, Ahmed Saoudi. icci 1992: 2-5

Alternating Automata, the Weak Monadic Theory of Trees and its ComplexityDavid E. Muller, Ahmed Saoudi, Paul E. Schupp. TCS, 97(2):233-244, 1992.

Finite State Processes, Z-Temporal Logic and the Monadic Theory of the IntegersAhmed Saoudi, David E. Muller, Paul E. Schupp. ijfcs, 3(3):233-244, 1992.

1990

On the Complexity of omega-Tree Sets and Nerode TheoremAhmed Saoudi, David E. Muller, Paul E. Schupp. ijfcs, 1(1):11-22, 1990.

1988

Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential TimeDavid E. Muller, Ahmed Saoudi, Paul E. Schupp. lics 1988: 422-427

1987

Alternating Automata on Infinite TreesDavid E. Muller, Paul E. Schupp. TCS, 54:267-276, 1987.

1986

Alternating Automata. The Weak Monadic Theory of the Tree, and its ComplexityDavid E. Muller, Ahmed Saoudi, Paul E. Schupp. icalp 1986: 275-283

Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic TheoriesDominique Perrin, Paul E. Schupp. lics 1986: 301-304

Arrays, Automata and Groups: Some InterconnectionsPaul E. Schupp. litp 1988: 19-28

1985

The Theory of Ends, Pushdown Automata, and Second-Order LogicDavid E. Muller, Paul E. Schupp. TCS, 37:51-75, 1985.

1984

Alternating automata on infinite objects, determinacy and Rabin s theoremDavid E. Muller, Paul E. Schupp. litp 1985: 100-107

Sur les Monoides À un Relateur qui sont des GroupesDominique Perrin, Paul E. Schupp. TCS, 33:331-334, 1984.

1983

Groups, the Theory of Ends, and Context-Free LanguagesDavid E. Muller, Paul E. Schupp. jcss, 26(3):295-310, 1983.

1981

Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability ProblemsDavid E. Muller, Paul E. Schupp. stoc 1981: 46-54

Sign in or sign up to see more results.

runs on WebDSL