Automatic semigroups
From MaRDI portal
Recommendations
- Automatic completely-simple semigroups
- Quasi-automatic semigroups
- Quasi-automatic semigroups
- Automaton semigroups
- Automaticity and commutative semigroups
- scientific article; zbMATH DE number 1857725
- A semigroup approach to automaticity
- Notions of automaticity in semigroups.
- Automatic semigroups vs automaton semigroups
- Fundamentals of Computation Theory
Cites work
- A NOTE ON CONTEXT-SENSITIVE LANGUAGES AND WORD PROBLEMS
- Automatic completely-simple semigroups
- Automatic groups and amalgams
- Automatic monoids and change of generators
- DETERMINING IDEALS OF A GIVEN FINITE INDEX IN A FINITELY PRESENTED SEMIGROUP
- Easy multiplications. I: The realm of Kleene's theorem
- Easy multiplications. II: Extensions of rational semigroups
- Generators and relations of direct products of semigroups
- scientific article; zbMATH DE number 988812 (Why is no real title available?)
- scientific article; zbMATH DE number 1189057 (Why is no real title available?)
- scientific article; zbMATH DE number 3654376 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 177837 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 1254101 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 1405695 (Why is no real title available?)
- scientific article; zbMATH DE number 3216273 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- Reidemeister-Schreier type rewriting for semigroups
- Small cancellation theory and automatic groups
- Small cancellation theory and automatic groups. II
- Strongly geodesically automatic groups are hyperbolic
- Structure Results for Transitive, Untwisted, Superlinked Finite Covers
- Syntactic and Rees indices of subsemigroups
- The use of Knuth-Bendix methods to solve the word problem in automatic groups
Cited in
(76)- Automaton semigroups
- Automatic presentations for semigroups.
- Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions.
- Notions of automaticity in semigroups.
- A semigroup approach to automaticity
- Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\)
- The monoid of queue actions
- The rotating normal form of braids is regular
- Extensions and submonoids of automatic monoids.
- Green index in semigroups: generators, presentations, and automatic structures.
- Automatic semigroups and Bruck-Reilly extensions.
- A note on automatic semigroups.
- Automatic presentations and semigroup constructions
- On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids
- Semigroups arising from asynchronous automata.
- A language hierarchy of binary relations
- Quasi-automatic groups are asynchronously automatic
- Automatic semigroup acts.
- On the complexity of the word problem for automaton semigroups and automaton groups
- An automatic semigroup of languages
- Automaticity of one-relator semigroups with length less than or equal to three
- Automatic semigroups and categories.
- Automatic Rees matrix semigroups over categories.
- Quasi-automatic semigroups
- Automatic structures for subsemigroups of Baumslag-Solitar semigroups.
- Automatic structures for semigroup constructions.
- Automatic subsemigroups of free products.
- Finite transducers for divisibility monoids
- Uniform decision problems for automatic semigroups.
- On the automaticity of singular Artin monoids of finite type.
- Markov semigroups, monoids and groups.
- On the structure of finitely generated semigroups of unary regular languages
- Decision problems for word-hyperbolic semigroups
- Where automatic structures benefit from weighted automata
- On graph products of automatic monoids
- Finitely generated semiautomatic groups
- scientific article; zbMATH DE number 3877253 (Why is no real title available?)
- CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS
- Automatic Presentations for Cancellative Semigroups
- The problem on automaticity of semigroups of regular languages.
- Properties of the subsemigroups of the bicyclic monoid
- MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS
- Automaticity and commutative semigroups
- The monoids of the patience sorting algorithm
- Finitely generated semiautomatic groups
- AUTOMATIC SEMIGROUPS WITH SUBSEMIGROUPS OF FINITE REES INDEX
- scientific article; zbMATH DE number 1857725 (Why is no real title available?)
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.
- scientific article; zbMATH DE number 2123356 (Why is no real title available?)
- Context-free rewriting systems and word-hyperbolic structures with uniqueness
- On certain pairs of non-Engel elements in finite groups.
- scientific article; zbMATH DE number 1408329 (Why is no real title available?)
- Quasi-automatic semigroups
- Automatic structure for generalized Bruck-Reilly \(*\)-extension of a monoid
- Automatic semigroups vs automaton semigroups
- Two applications of monoid actions to cross-sections
- Rewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids.
- Automaton semigroups: new constructions results and examples of non-automaton semigroups
- Semi-groupes fortement automatiques.
- The loop problem for monoids and semigroups
- DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
- Presentations and word problem for strong semilattices of semigroups.
- Asynchronously automatic semigroups.
- Subsemigroups of groups: presentations, Malcev presentations, and automatic structures
- LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
- A GROUP-EMBEDDABLE NON-AUTOMATIC SEMIGROUP WHOSE UNIVERSAL GROUP IS AUTOMATIC
- Fundamentals of Computation Theory
- On the growth and integral (co)homology of free regular star-monoids
- Automatic semigroups producing an automaton semigroup
- Finiteness and Dehn functions of automatic monoids having directed fellow traveller property.
- A strong geometric hyperbolicity property for directed graphs and monoids.
- Automaton semigroup constructions.
- Notions of hyperbolicity in monoids.
- A geometric characterization of automatic semigroups
- FA-presentable groups and rings
- Partial automorphism semigroups
This page was built for publication: Automatic semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589444)
