Ordered catenation and regular free disjunctive languages

DOI10.1016/S0019-9958(80)90790-1zbMATH Open0453.68046OpenAlexW2007304863MaRDI QIDQ3901013FDOQ3901013

Authors: H. J. Shyr 

Publication date: 1980

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(80)90790-1

zbMATH Keywords

prefix codedisjunctive languageregular free language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45) Semigroups in automata theory, linguistics, etc. (20M35)

Cited In (11)

• F-Disjunctive languagest
• The single loop representations of regular languages
• Disjunctive splittability of languages
• \(d\)-minimal languages
• Word-paired catenations of regular languages
• Outfix and infix codes and related classes of languages
• Quasi-completely right disjunctive languages
• Solid codes and disjunctive domains
• Word-paired insertions of languages
• Some results in \(r\)-disjunctive languages and related topics
• Monoids with disjunctive identity and their codes

This page was built for publication: Ordered catenation and regular free disjunctive languages

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