Operations preserving regular languages
From MaRDI portal
Publication:2368978
Recommendations
Cites work
- An application of the matrix representation of transductions
- Context-free preserving functions
- scientific article; zbMATH DE number 5643878 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 2012392 (Why is no real title available?)
- scientific article; zbMATH DE number 798167 (Why is no real title available?)
- scientific article; zbMATH DE number 3293666 (Why is no real title available?)
- scientific article; zbMATH DE number 3337664 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Operations preserving recognizable languages.
- Regularity preserving modifications of regular expressions
- Regularity-preserving relations
- The monadic theory of morphic infinite words and generalizations
Cited in
(13)- Decimations of languages and state complexity
- Performing regular operations with 1-limited automata
- Transducer degrees: atoms, infima and suprema
- A noncommutative extension of Mahler's theorem on interpolation series
- Degrees of Infinite Words, Polynomials and Atoms
- Newton's forward difference equation for functions from words to words
- scientific article; zbMATH DE number 124135 (Why is no real title available?)
- scientific article; zbMATH DE number 1944129 (Why is no real title available?)
- Degrees of infinite words, polynomials and atoms
- Filtrations of formal languages by arithmetic progressions
- Operations preserving recognizable languages.
- Stone duality, topological algebra, and recognition.
- Lexicographic transductions of finite words
This page was built for publication: Operations preserving regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2368978)