Disjunctive splittability of languages

DOI10.1007/BF02573133zbMATH Open0648.20063OpenAlexW2071609840MaRDI QIDQ1105047FDOQ1105047

Authors: Masashi Katsura 

Publication date: 1988

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

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

Recommendations

• A characterization of dense languages
• scientific article; zbMATH DE number 2106355
• Classifications of dense languages
• scientific article; zbMATH DE number 3982541
• Disjunctive decomposition of languages
• A characterization of s-languages
• Non-disjunctive dense languages and generalized Dyck codes
• Free submonoids in the monoid of languages
• scientific article; zbMATH DE number 4215377
• Fast stabbing of boxes in high dimensions

zbMATH Keywords

free monoidfinite alphabetprefix codesfinite 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
• Title not available (Why is that?)
• Some properties of disjunctive languages on a free monoid
• A characterization of dense languages
• Ordered catenation and regular free disjunctive languages
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• F-Disjunctive languagest
• Title not available (Why is that?)
• Non-disjunctive dense languages and generalized Dyck codes
• Some relation-discrete languages
• Bipartite Exhaustification: Evidence from Vietnamese
• Relatively f-disjunctive languages
• A characterization of dense languages
• Disjunctive decomposition of languages

This page was built for publication: Disjunctive splittability of languages

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