LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE

DOI10.1142/S0218196706003001zbMATH Open1151.03003MaRDI QIDQ5483463FDOQ5483463

Dietrich Kuske, Markus Lohrey

Publication date: 14 August 2006

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

Cayley graphsdecidable theoriesgraph products of monoids

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Decidability of theories and sets of sentences (03B25) Free semigroups, generators and relations, word problems (20M05)

Cites Work

• Title not available (Why is that?)
• Algorithms and geometry for graph products of groups
• Monadic second-order logic on tree-like structures
• GRAPH PRODUCTS AND CANNON PAIRS
• On transitive Cayley graphs of groups and semigroups
• On theories with a combinatorial definition of 'equivalence'
• Combinatorial problems of commutation and rearrangements
• Automatic semigroups
• Logical aspects of Cayley-graphs: the group case
• The theory of ends, pushdown automata, and second-order logic
• The complexity of logical theories
• A combinatorial property and Cayley graphs of semigroups
• Groups, the theory of ends, and context-free languages
• The monadic theory of order
• Impossibility of an algorithm for the decision problem in finite classes
• A uniform method for proving lower bounds on the computational complexity of logical theories
• Groups and graphs: Groups acting on trees, ends, and cancellation diagrams
• DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
• Graph products of monoids
• Confluent and Other Types of Thue Systems
• Preperfectness is undecidable for Thue systems containing only length- reducing rules and a single commutation rule
• Extensions and submonoids of automatic monoids.
• On graph products of automatic monoids

Cited In (12)

• Closure properties of knapsack semilinear groups
• Knapsack in graph groups
• WORD EQUATIONS OVER GRAPH PRODUCTS
• Groups, graphs, languages, automata, games and second-order monadic logic
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Inverse monoids: decidability and complexity of algebraic questions.
• The power word problem in graph products
• Title not available (Why is that?)
• Finite presentability and isomorphism of Cayley graphs of monoids
• COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS
• MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS
• On decidability of list structures

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On graph products of monoids 👍 👎
• Cayley Digraphs of Finite Abelian Groups and Monomial Ideals 👍 👎
• On monoid graphs 👍 👎
• Logical aspects of Cayley-graphs: the group case 👍 👎
• On Cayley graphs of semilattices of semigroups. 👍 👎
• Finite presentability and isomorphism of Cayley graphs of monoids 👍 👎
• Graphs and ranks of monoids 👍 👎

This page was built for publication: LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483463)