The following pages link to Automatic semigroups (Q1589444):
Displaying 50 items.
- Decision problems for word-hyperbolic semigroups (Q306545) (← links)
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. (Q479731) (← links)
- Automaton semigroups: new constructions results and examples of non-automaton semigroups (Q528468) (← links)
- Automatic semigroups producing an automaton semigroup (Q721279) (← links)
- Finiteness and Dehn functions of automatic monoids having directed fellow traveller property. (Q731326) (← links)
- A strong geometric hyperbolicity property for directed graphs and monoids. (Q743919) (← links)
- Automaton semigroup constructions. (Q744860) (← links)
- Notions of hyperbolicity in monoids. (Q846368) (← links)
- A geometric characterization of automatic semigroups (Q861269) (← links)
- FA-presentable groups and rings (Q947484) (← links)
- Partial automorphism semigroups (Q998310) (← links)
- Automaton semigroups (Q1034622) (← links)
- Automatic presentations for semigroups. (Q1041033) (← links)
- Undecidable properties of monoids with word problem solvable in linear time. II: Cross sections and homological and homotopical finiteness conditions. (Q1399980) (← links)
- Notions of automaticity in semigroups. (Q1402893) (← links)
- A semigroup approach to automaticity (Q1407498) (← links)
- 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}\) (Q1633382) (← links)
- The monoid of queue actions (Q1702520) (← links)
- The rotating normal form of braids is regular (Q1703234) (← links)
- Extensions and submonoids of automatic monoids. (Q1853554) (← links)
- Green index in semigroups: generators, presentations, and automatic structures. (Q1939495) (← links)
- Automatic semigroups and Bruck-Reilly extensions. (Q1945251) (← links)
- A note on automatic semigroups. (Q1955595) (← links)
- Automatic presentations and semigroup constructions (Q1959386) (← links)
- On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids (Q2013556) (← links)
- A language hierarchy of binary relations (Q2216121) (← links)
- Quasi-automatic groups are asynchronously automatic (Q2326413) (← links)
- Automatic semigroup acts. (Q2344292) (← links)
- On the complexity of the word problem for automaton semigroups and automaton groups (Q2363312) (← links)
- An automatic semigroup of languages (Q2363384) (← links)
- Automaticity of one-relator semigroups with length less than or equal to three (Q2364902) (← links)
- Automatic semigroups and categories. (Q2368995) (← links)
- Automatic Rees matrix semigroups over categories. (Q2373412) (← links)
- Quasi-automatic semigroups (Q2422022) (← links)
- Automatic structures for subsemigroups of Baumslag-Solitar semigroups. (Q2447245) (← links)
- Automatic structures for semigroup constructions. (Q2481327) (← links)
- Automatic subsemigroups of free products. (Q2482061) (← links)
- Finite transducers for divisibility monoids (Q2508976) (← links)
- Uniform decision problems for automatic semigroups. (Q2509285) (← links)
- On the automaticity of singular Artin monoids of finite type (Q2855750) (← links)
- Markov semigroups, monoids and groups. (Q2923337) (← links)
- ON THE STRUCTURE OF FINITELY GENERATED SEMIGROUPS OF UNARY REGULAR LANGUAGES (Q3056271) (← links)
- Where Automatic Structures Benefit from Weighted Automata (Q3098042) (← links)
- On graph products of automatic monoids (Q3149082) (← links)
- (Q3344250) (← links)
- CANCELLATIVITY IS UNDECIDABLE FOR AUTOMATIC SEMIGROUPS (Q3429796) (← links)
- Automatic Presentations for Cancellative Semigroups (Q3540105) (← links)
- Properties of the subsemigroups of the bicyclic monoid (Q3624885) (← links)
- MONOIDS PRESENTED BY REWRITING SYSTEMS AND AUTOMATIC STRUCTURES FOR THEIR SUBMONOIDS (Q3643582) (← links)
- The monoids of the patience sorting algorithm (Q4629511) (← links)
