The single loop representations of regular languages

DOI10.1016/S0166-218X(97)86751-0MaRDI QIDQ1383380zbMATH OpenFDO

Authors H. J. Shyr, Shyr-Shen Yu

Publication date 13 April 1998

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL http://www.elsevier.com/locate/dam

zbMATH Keywords

fs-representable languageregular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Regular component decomposition of regular languages.
• Finite loops recognize exactly the regular open languages
• scientific article; zbMATH DE number 6136496
• Language-theoretical representations of \(\omega\)-languages
• Isometries on positive operators of unit norm

Cites work

• H-bounded and semi-discrete languages
• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 3566726 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Numeration systems, linear recurrences, and regular sets
• Ordered catenation and regular free disjunctive languages
• Regular component splittable languages
• Semi-discrete context-free languages^†
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Thin and slender languages

Cited in

(4)

• Regular component decomposition of regular languages.
• Word-paired catenations of regular languages
• scientific article; zbMATH DE number 6136496 (Why is no real title available?)
• Every regular bifix code is a finite union of regular infix codes

This page was built for publication: The single loop representations of regular languages

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