Infix Congruences on a Free Monoid

DOI10.2307/2001149zbMath0663.20062OpenAlexW4246373979MaRDI QIDQ3812464

Cecília M. Reis

Publication date: 1989

Full work available at URL: https://doi.org/10.2307/2001149

zbMATH Keywords

wordslanguagefinite alphabetfree monoidsyntactic congruenceinfix codef- disjunctiveinfix cancellative congruenceinfix congruences

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Mappings of semigroups (20M15)

Related Items (5)

Relatively f-disjunctive languages ⋮ When are Rees Congruences Principal? ⋮ f-disjunctive congruences and a generalization of monoids with length ⋮ Characterizations of Linear Congruences on a Free Monoid ⋮ On some non-rational congruences on free commutative semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• A note on F-disjunctive languages
• F-Disjunctive languagest
• Hypercodes
• On free monoids partially ordered by embedding

This page was built for publication: Infix Congruences on a Free Monoid