Deciding the immutability of regular codes and languages under finite transduction

DOI10.1016/0020-0190(89)90080-XzbMath0672.68036MaRDI QIDQ1120291

Tom Head

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

regular languagecodestransducerimmutability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items (1)

Relativized codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sur les rélations rationnelles entre monoides libres
• Single-valued a-transducers
• How to reuse a “write-once≓ memory
• An efficient algorithm for testing immutability of variable-length codes
• On testing for immutability of codes (Corresp.)
• A note on finite-valued and finitely ambiguous transducers

This page was built for publication: Deciding the immutability of regular codes and languages under finite transduction