Pages that link to "Item:Q1853526"
From MaRDI portal
The following pages link to Determinization of transducers over finite and infinite words. (Q1853526):
Displaying 20 items.
- Subsequential transducers: a coalgebraic perspective (Q618167) (← links)
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality. (Q1853731) (← links)
- Minimizing subsequential transducers: a survey. (Q1853736) (← links)
- Determinization of transducers over infinite words: The general case (Q1882533) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- Detectability of labeled weighted automata over monoids (Q2081085) (← links)
- Disambiguation of weighted tree automata (Q2096595) (← links)
- Sequentiality of group-weighted tree automata (Q2232288) (← links)
- Coalgebraising subsequential transducers (Q2873665) (← links)
- Degree of Sequentiality of Weighted Automata (Q2988370) (← links)
- Multi-sequential Word Relations (Q3451110) (← links)
- (Q4611380) (← links)
- Multi-Sequential Word Relations (Q4640041) (← links)
- (Q5090448) (← links)
- (Q5092330) (← links)
- Fragile words and Cayley type transducers (Q5124053) (← links)
- On the computation of covert channel capacity (Q5190077) (← links)
- (Q5376652) (← links)
- FINITELY SUBSEQUENTIAL TRANSDUCERS (Q5696948) (← links)
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)