Infix Congruences on a Free Monoid

DOI10.2307/2001149zbMATH Open0663.20062OpenAlexW4246373979MaRDI QIDQ3812464FDOQ3812464

Authors: Cecília M. Reis 

Publication date: 1989

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

Recommendations

• The Syntactic Monoid of an Infix Code
• scientific article; zbMATH DE number 4039328
• scientific article; zbMATH DE number 148019
• Some decidable congruences of free monoids
• Perfect Congruences on a Free Monoid

zbMATH Keywords

wordsfree monoidfinite alphabetlanguagesyntactic congruenceinfix codef- disjunctiveinfix cancellative congruenceinfix congruences

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On free monoids partially ordered by embedding
• Hypercodes
• Title not available (Why is that?)
• F-Disjunctive languagest
• A note on F-disjunctive languages

Cited In (12)

• Some decidable congruences of free monoids
• On some non-rational congruences on free commutative semigroups
• Characterizations of Linear Congruences on a Free Monoid
• The Syntactic Monoid of an Infix Code
• Title not available (Why is that?)
• When are Rees Congruences Principal?
• Congruences Associated with Dol-Schemes
• f-disjunctive congruences and a generalization of monoids with length
• Relatively f-disjunctive languages
• Title not available (Why is that?)
• E-convex infix codes
• CONJUGACY IN FREE INVERSE MONOIDS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3812464)