Equations Defining the Polynomial Closure of a Lattice of Regular Languages
From MaRDI portal
Publication:3638090
DOI10.1007/978-3-642-02930-1_10zbMath1248.68340OpenAlexW1486333087MaRDI QIDQ3638090
Mário J. J. Branco, Jean-Eric Pin
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02930-1_10
Related Items
On Decidability of Intermediate Levels of Concatenation Hierarchies ⋮ Factorization forests for infinite words and applications to countable scattered linear orderings ⋮ The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies ⋮ Separating Without Any Ambiguity. ⋮ Theme and Variations on the Concatenation Product ⋮ Stone duality, topological algebra, and recognition. ⋮ Generic results for concatenation hierarchies ⋮ Varieties ⋮ The factorisation forest theorem
This page was built for publication: Equations Defining the Polynomial Closure of a Lattice of Regular Languages
