The single loop representations of regular languages

DOI10.1016/S0166-218X(97)86751-0zbMath0894.68092MaRDI QIDQ1383380

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

regular languagefs-representable language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Regular component decomposition of regular languages. ⋮ Word-paired catenations of regular languages ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Regular component splittable languages
• Numeration systems, linear recurrences, and regular sets
• Thin and slender languages
• Semi-discrete context-free languages^†
• Ordered catenation and regular free disjunctive languages
• H-bounded and semi-discrete languages

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