Fundamentals of Computation Theory
From MaRDI portal
Publication:5492916
DOI10.1007/11537311zbMath1123.68073OpenAlexW2491671784MaRDI QIDQ5492916
No author found.
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11537311
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (9)
Automaticity of one-relator semigroups with length less than or equal to three ⋮ 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}\) ⋮ Decision problems for word-hyperbolic semigroups ⋮ Notions of hyperbolicity in monoids. ⋮ Automatic semigroups and Bruck-Reilly extensions. ⋮ The monoids of the patience sorting algorithm ⋮ Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. ⋮ On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids ⋮ Unnamed Item
This page was built for publication: Fundamentals of Computation Theory
