On Straight Words and Minimal Permutators in Finite Transformation Semigroups

DOI10.1007/978-3-642-18098-9_13zbMath1297.68173arXiv1002.2793OpenAlexW1880280254MaRDI QIDQ3073628

Chrystopher L. Nehaniv, Attila Egri-Nagy

Publication date: 11 February 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1002.2793

Mathematics Subject Classification ID

Combinatorics on words (68R15) Semigroups of transformations, relations, partitions, etc. (20M20) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (1)

Symmetry structure in discrete models of biochemical systems: natural subsystems and the weak control hierarchy in a new model of computation driven by interactions

Uses Software

• GAP
• SgpDec
• Krohn-Rhodes

Cites Work

• Unnamed Item
• Classical finite transformation semigroups. An introduction.
• Implementation and Application of Automata

This page was built for publication: On Straight Words and Minimal Permutators in Finite Transformation Semigroups