Equations Defining the Polynomial Closure of a Lattice of Regular Languages
From MaRDI portal
Publication:3638090
DOI10.1007/978-3-642-02930-1_10zbMath1248.68340MaRDI 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
68Q70: Algebraic theory of languages and automata
Related Items
Separating Without Any Ambiguity., Stone duality, topological algebra, and recognition., The omega-reducibility of pseudovarieties of ordered monoids representing low levels of concatenation hierarchies, Factorization forests for infinite words and applications to countable scattered linear orderings, Varieties, The factorisation forest theorem, Generic results for concatenation hierarchies, Theme and Variations on the Concatenation Product, On Decidability of Intermediate Levels of Concatenation Hierarchies