A closure property of regular languages

DOI10.1016/0304-3975(88)90128-4zbMath0661.68076OpenAlexW2041963673MaRDI QIDQ1113686

Thomas Kretschmer

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90128-4

zbMATH Keywords

inverse imageregular languagesregular setssemigroup homomorphism

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Codes modulo finite monadic string-rewriting systems, Some undecidability results concerning the property of preserving regularity

Cites Work

• Monadic Thue systems
• Unnamed Item