Disjunctive splittability of languages

DOI10.1007/BF02573133zbMath0648.20063OpenAlexW2071609840MaRDI QIDQ1105047

Masashi Katsura

Publication date: 1988

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/134924

zbMATH Keywords

prefix codesfinite alphabetfree monoidfinite languagedense languagediscrete languagessemi-DP-splittable

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• The equation \(a_ M=b^ Nc^ P\) in a free group
• A characterization of dense languages
• Ordered catenation and regular free disjunctive languages
• Some properties of disjunctive languages on a free monoid
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Disjunctive splittability of languages