Paul E. Schupp

J. Math. Log., August, 2024

2017

Computational complexity and the conjugacy problem.

[BibT_eX]

[DOI]

Alexei Miasnikov

Comput., 2017

Asymptotic Density and the Theory of Computability: A Partial Survey.

[BibT_eX]

[DOI]

Tullio Ceccherini-Silberstein

Proceedings of the Computability and Complexity, 2017

2016

Coarse Reducibility and Algorithmic Randomness.

[BibT_eX]

[DOI]

J. Symb. Log., 2016

Asymptotic density and the coarse computability bound.

[BibT_eX]

[DOI]

Comput., 2016

2015

Multipass automata and group word problems.

[BibT_eX]

[DOI]

Michel Coornaert

Francesca Fiorenzi

Tullio Ceccherini-Silberstein

Nicholas W. M. Touikan

Theor. Comput. Sci., 2015

Asymptotic density and the Ershov hierarchy.

[BibT_eX]

[DOI]

Math. Log. Q., 2015

2014

Multipass automata and group word problems.

[BibT_eX]

[DOI]

Michel Coornaert

Francesca Fiorenzi

CoRR, 2014

2013

Asymptotic density and computably Enumerable Sets.

[BibT_eX]

[DOI]

Rodney G. Downey

J. Math. Log., 2013

2012

Generic computability, Turing degrees, and asymptotic density.

[BibT_eX]

[DOI]

Tullio Ceccherini-Silberstein

J. Lond. Math. Soc., 2012

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

[BibT_eX]

[DOI]

Michel Coornaert

Francesca Fiorenzi

Eur. J. Comb., 2012

2007

Membership Problem for the Modular Group.

[BibT_eX]

[DOI]

Yuri Gurevich

SIAM J. Comput., 2007

Some Quantitative Aspects of Fractional Computability

[BibT_eX]

[DOI]

Ilya Kapovich

CoRR, 2007

2003

Generic properties of Whitehead's Algorithm, stabilizers in Aut(F<sub>k</sub>) and one-relator groups

[BibT_eX]

[DOI]

Ilya Kapovich

Vladimir Shpilrain

CoRR, 2003

2002

Average-case complexity and decision problems in group theory

[BibT_eX]

[DOI]

CoRR, 2002

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

[BibT_eX]

[DOI]

CoRR, 2002

1998

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

1995

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

1992

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

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

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

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

[BibT_eX]

Proceedings of the Computing and Information, 1992

1990

On the Complexity of omega-Tree Sets and Nerode Theorem.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1990

1988

Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987

Alternating Automata on Infinite Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

1986

Arrays, Automata and Groups: Some Interconnections.

[BibT_eX]

[DOI]

Proceedings of the Automata Networks, LITP Spring School on Theoretical Computer Science, 1986

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

[BibT_eX]

Dominique Perrin

Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

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

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

1985

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

1984

Sur les Monoides À un Relateur qui sont des Groupes.

[BibT_eX]

[DOI]

Dominique Perrin

Theor. Comput. Sci., 1984

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

[BibT_eX]

[DOI]

Proceedings of the Automata on Infinite Words, 1984

1983

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

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

1981

Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems

[BibT_eX]

[DOI]