Pages that link to "Item:Q3925892"

The following pages link to Equivalence problems for mappings on infinite strings (Q3925892):

Displaying 8 items.

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