On Approximating Non-regular Languages by Regular Languages

DOI10.3233/FI-2011-532zbMath1234.68209OpenAlexW1826276606MaRDI QIDQ3100930

G. Eisman, Bala Ravikumar

Publication date: 22 November 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2011-532

zbMATH Keywords

approximationfinite automatasquaringmajority language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Asymptotic approximation by regular languages ⋮ On counting functions and slenderness of languages

This page was built for publication: On Approximating Non-regular Languages by Regular Languages