Pages that link to "Item:Q1959399"
From MaRDI portal
The following pages link to Lexicographic decomposition of \(k\)-valued transducers (Q1959399):
Displaying 14 items.
- Algorithmic aspects of decomposition and equivalence of finite-valued transducers (Q259883) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- A simple method for building bimachines from functional finite-state transducers (Q2399253) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- Visibly Pushdown Transducers with Look-Ahead (Q2891373) (← links)
- Decomposing a $k$-valued transducer into $k$ unambiguous ones (Q3126010) (← links)
- Multi-sequential Word Relations (Q3451110) (← links)
- Multi-Sequential Word Relations (Q4640041) (← links)
- On the decomposition of \(k\)-valued rational relations (Q4910755) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- (Q5092324) (← links)
- (Q5092440) (← links)
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
