Equivalence problems for mappings on infinite strings

DOI10.1016/S0019-9958(81)90444-7MaRDI QIDQ3925892zbMATH OpenWikidataFDO

Authors Karel II Culik, Jan Pachl

Publication date 1981

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(81)90444-7

zbMATH Keywords

functional finite- state transducershomomorphismsomega languagesomega regular set

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(8)

• Two decidability problems for infinite words
• Test sets for languages of infinite words
• Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
• On computability of data word functions defined by transducers
• An axiomatic approach to the Korenjak-Hopcroft algorithms
• Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords
• Closure properties of subclasses of ω-regular languages under morphism and inverse morphism
• Closure properties of subclasses of ω-regular languages under morphism and inverse morphism

This page was built for publication: Equivalence problems for mappings on infinite strings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3925892)