On bounded rational trace languages

DOI10.1007/S00224-008-9143-9zbMATH Open1209.68295OpenAlexW2148580794MaRDI QIDQ970110FDOQ970110

Authors: Christian Choffrut, Flavio D'Alessandro, Stefano Varricchio 

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

Recommendations

• Rational and recognizable complex trace languages
• scientific article; zbMATH DE number 512855
• A note on the logical definability of rational trace languages
• Logical definability of some rational trace languages
• On regular trace languages
• Publication:4508302
• scientific article
• scientific article
• scientific article
• scientific article; zbMATH DE number 3848633

zbMATH Keywords

bounded languagesrational relationstrace languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Rational sets in commutative monoids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the structure of the counting function of sparse context-free languages.
• Sur les rélations rationnelles entre monoides libres
• Interpolated Denumerants and Lambert Series
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the separability of sparse context-free languages and of bounded rational relations

Cited In (6)

• Sparse and slender subsets of monoids.
• On free spectra of finite monoids from the pseudovariety \(\mathsf{DA}\).
• Growth of monomial algebras, simple rings and free subalgebras
• On bounded linear codes and the commutative equivalence
• Theory Is Forever
• Title not available (Why is that?)

This page was built for publication: On bounded rational trace languages

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