How to prove that a language is regular or star-free?
From MaRDI portal
Publication:782557
DOI10.1007/978-3-030-40608-0_5zbMath1437.68104OpenAlexW3007045219MaRDI QIDQ782557
Publication date: 27 July 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-40608-0_5
Related Items (3)
Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages ⋮ Well quasi-orders arising from finite ordered semigroups ⋮ Regularity conditions for iterated shuffle on commutative regular languages
This page was built for publication: How to prove that a language is regular or star-free?
