Equivalence problems for mappings on infinite strings
From MaRDI portal
Publication:3925892
DOI10.1016/S0019-9958(81)90444-7zbMath0472.68045WikidataQ58330010 ScholiaQ58330010MaRDI QIDQ3925892
Publication date: 1981
Published in: Information and Control (Search for Journal in Brave)
Related Items (8)
An axiomatic approach to the Korenjak-Hopcroft algorithms ⋮ Closure properties of subclasses of ω-regular languages under morphism and inverse morphism ⋮ Test sets for languages of infinite words ⋮ Algorithmic solvability of comparison problems for finitely ambiguous sequence transducers on superwords ⋮ Closure properties of subclasses of ω-regular languages under morphism and inverse morphism ⋮ On computability of data word functions defined by transducers ⋮ Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems ⋮ Two decidability problems for infinite words
This page was built for publication: Equivalence problems for mappings on infinite strings
