More on the Size of Higman-Haines Sets: Effective Constructions

DOI10.3233/FI-2009-0035zbMath1192.68410OpenAlexW4248122200MaRDI QIDQ5902078

Hermann Gruber, Markus Holzer, Martin Kutrib

Publication date: 23 June 2009

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

Full work available at URL: https://doi.org/10.3233/fi-2009-0035

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items (9)

Quotient complexity of closed languages ⋮ Decidability of involution hypercodes ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Further closure properties of input-driven pushdown automata ⋮ Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity ⋮ Descriptional complexity of regular languages ⋮ Commutative regular languages with product-form minimal automata ⋮ State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages

This page was built for publication: More on the Size of Higman-Haines Sets: Effective Constructions