The single loop representations of regular languages
From MaRDI portal
Publication:1383380
DOI10.1016/S0166-218X(97)86751-0zbMath0894.68092MaRDI QIDQ1383380
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
68Q45: Formal languages and automata
Related Items
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