Inverse Automata and Monoids and the Undecidability of the Cayley Subgraph Problem for Groups

Glasgow Mathematical Journal- United Kingdom

doi 10.1017/s001708950003010x

Full Text

Abstract

Available in

Categories

Mathematics

Date

Authors

Publisher

Cambridge University Press (CUP)

Related search

Combinatorial Group Theory, Inverse Monoids, Automata, and Global Semigroup Theory

International Journal of Algebra and Computation
Mathematics
2002English

ACME: Automata With Counters, Monoids and Equivalence

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Undecidability Results for Timed Automata With Silent Transitions

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

On Finite Monoids of Cellular Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Inverse Monoids, Trees and Context-Free Languages

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1993English

Online Ramsey Numbers and the Subgraph Query Problem

Building Bridges II
2019English

Integral Cayley Sum Graphs and Groups

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2016English

A Characterization of the Maximal Monoids and Maximal Groups inβX

Pacific Journal of Mathematics
Mathematics
1975English

Transitions: Contractions and Analytical Continuations of the Cayley-Klein Groups

International Journal of Theoretical Physics
MathematicsAstronomyPhysics
1990English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy