Ordered catenation and regular free disjunctive languages
From MaRDI portal
Publication:3901013
DOI10.1016/S0019-9958(80)90790-1zbMath0453.68046OpenAlexW2007304863MaRDI QIDQ3901013
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
Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)
Related Items
Word-paired catenations of regular languages, Monoids with disjunctive identity and their codes, Disjunctive splittability of languages, The single loop representations of regular languages, Some results in \(r\)-disjunctive languages and related topics, Solid codes and disjunctive domains, Quasi-completely right disjunctive languages, F-Disjunctive languagest, Outfix and infix codes and related classes of languages, Word-paired insertions of languages, \(d\)-minimal languages