Substitution Principle and semidirect products

DOI10.1017/s0960129523000294arXiv2106.12525MaRDI QIDQ6190406

Célia Borlido, Mai Gehrke

Publication date: 5 March 2024

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.12525

zbMATH Keywords

semidirect productquantifierformal languagesubstitutionlogic on wordsBoolean space with an internal monoid

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Regular languages and Stone duality
• Regular languages in \(NC\)
• Closure of varieties of languages under products with counter
• Free profinite semigroups over semidirect products
• Codensity, profiniteness and algebras of semiring-valued measures
• Polyadic spaces and profinite monoids
• Nonuniform ACC Circuit Lower Bounds
• Parity, circuits, and the polynomial-time hierarchy
• Duality and Equational Theory of Regular Languages
• A Topological Approach to Recognition
• The Sch\"utzenberger product for syntactic spaces
• Quantifiers on languages and codensity monads
• Stone Duality and the Substitution Principle
• Logic Meets Algebra: the Case of Regular Languages
• STACS 2005
• Extensions of Topological Spaces
• Stone duality, topological algebra, and recognition.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Substitution Principle and semidirect products