On bounded rational trace languages
From MaRDI portal
Publication:970110
DOI10.1007/s00224-008-9143-9zbMath1209.68295MaRDI QIDQ970110
Stefano Varricchio, Flavio D'Alessandro, Christian Choffrut
Publication date: 10 May 2010
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-008-9143-9
68Q45: Formal languages and automata
Cites Work
- On the separability of sparse context-free languages and of bounded rational relations
- Sur les rélations rationnelles entre monoides libres
- On the structure of the counting function of sparse context-free languages.
- Rational sets in commutative monoids
- Interpolated Denumerants and Lambert Series
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item