Operations preserving regular languages
From MaRDI portal
Publication:2368978
DOI10.1016/j.tcs.2005.11.034zbMath1088.68086OpenAlexW2045574270MaRDI QIDQ2368978
Jean-Eric Pin, Jean Berstel, Olivier Carton, Luc Boasson, Bruno Petazzoni
Publication date: 28 April 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.11.034
Related Items
Newton’s Forward Difference Equation for Functions from Words to Words ⋮ Transducer degrees: atoms, infima and suprema ⋮ A noncommutative extension of Mahler's theorem on interpolation series ⋮ Degrees of Infinite Words, Polynomials and Atoms ⋮ Stone duality, topological algebra, and recognition. ⋮ Degrees of Infinite Words, Polynomials and Atoms ⋮ Decimations of languages and state complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An application of the matrix representation of transductions
- Regularity-preserving relations
- The monadic theory of morphic infinite words and generalizations
- Regularity preserving modifications of regular expressions
- Context-free preserving functions
- Fundamentals of Computation Theory