Pages that link to "Item:Q3599160"
From MaRDI portal
The following pages link to On the Decidability of Bounded Valuedness for Transducers (Q3599160):
Displaying 12 items.
- Algorithmic aspects of decomposition and equivalence of finite-valued transducers (Q259883) (← links)
- Queries on XML streams with bounded delay and concurrency (Q553309) (← links)
- Lexicographic decomposition of \(k\)-valued transducers (Q1959399) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- Equivalence Checking Problem for Finite State Transducers over Semigroups (Q2947161) (← links)
- Nondeterministic Streaming String Transducers (Q3012906) (← links)
- On the Decidability of the Equivalence for k-Valued Transducers (Q3533016) (← links)
- Bounded Delay and Concurrency for Earliest Query Answering (Q3618594) (← links)
- On the Decidability of the Equivalence for a Certain Class of Transducers (Q3637249) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- Register Transducers Are Marble Transducers (Q5089194) (← links)
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)
