Word-paired catenations of regular languages

DOI10.1016/J.DISC.2004.04.013MaRDI QIDQ1886339zbMATH OpenOpenAlexFDO

Authors H. K. Hsiao, Yu-Kuang Zhao, Shyr-Shen Yu

Publication date 18 November 2004

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.04.013

zbMATH Keywords

Complement of a wordLanguageLocalRegularRegular-freeReverseWord-paired catenation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Word-paired insertions of languages
• scientific article; zbMATH DE number 1809727
• scientific article; zbMATH DE number 3926266
• CATENATION CLOSED PAIRS AND FOREST LANGUAGES
• Concatenation of regular languages and descriptional complexity

Cites work

• A characterization of local regular languages
• Free submonoids in the monoid of languages
• scientific article; zbMATH DE number 1186091 (Why is no real title available?)
• scientific article; zbMATH DE number 3571510 (Why is no real title available?)
• scientific article; zbMATH DE number 3639883 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Ordered catenation and regular free disjunctive languages
• Semi-discrete context-free languages^†
• The equation \(a_ M=b^ Nc^ P\) in a free group
• The single loop representations of regular languages
• Thin and slender languages
• Word-paired insertions of languages

Cited in

(3)

• scientific article; zbMATH DE number 1809727 (Why is no real title available?)
• Word-paired insertions of languages
• CATENATION CLOSED PAIRS AND FOREST LANGUAGES

This page was built for publication: Word-paired catenations of regular languages

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