Word-paired catenations of regular languages

DOI10.1016/j.disc.2004.04.013zbMath1072.68056OpenAlexW2087369330MaRDI QIDQ1886339

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

LanguageRegularLocalReverseComplement of a wordRegular-freeWord-paired catenation

Mathematics Subject Classification ID

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

Related Items (1)

Word-paired insertions of languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Free submonoids in the monoid of languages
• The single loop representations of regular languages
• A characterization of local regular languages
• Thin and slender languages
• Semi-discrete context-free languages^†
• Ordered catenation and regular free disjunctive languages
• Word-paired insertions of languages

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