A closure property of regular languages
From MaRDI portal
Given a semigroup homomorphism \(\theta\) : \(X^*\to {\mathcal P}(Y^*)\) where \({\mathcal P}(Y^*)\) is the powerset of \(Y^*\), we show that the inverse image \(K\theta^{-1}\) of a regular set \(K\subseteq Y^*\) is regular, too. This theorem has several consequences generalizing previously known results.
Recommendations
- Regular Closure of Deterministic Languages
- scientific article; zbMATH DE number 2012396
- Closure properties and complexity of rational sets of regular languages
- Closure properties of subregular languages under operations
- The full quotient and its closure property for regular languages
- Closure properties of pattern languages
- Closure properties of pattern languages
- Closure properties of slender languages
- Closure of finite-state automaton languages
Cites work
Cited in
(6)- On morphic generation of regular languages
- Some undecidability results concerning the property of preserving regularity
- Closure properties of slender languages
- Codes modulo finite monadic string-rewriting systems
- Closure of finite-state automaton languages
- Closure properties and complexity of rational sets of regular languages
This page was built for publication: A closure property of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1113686)
