The following pages link to (Q3853135):
Displaying 16 items.
- Subsequential transducers: a coalgebraic perspective (Q618167) (← links)
- Varieties and rational functions (Q673101) (← links)
- Counting with rational functions (Q1115616) (← links)
- A closure property of deterministic context-free languages (Q1149789) (← links)
- A proof of Choffrut's theorem on subsequential functions (Q1285595) (← links)
- Minimization algorithms for sequential transducers (Q1575676) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- Determinization of transducers over finite and infinite words. (Q1853526) (← links)
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality. (Q1853731) (← links)
- Sequential? (Q2490822) (← links)
- Computing the prefix of an automaton (Q2729627) (← links)
- Coalgebraising Subsequential Transducers (Q2873665) (← links)
- A Circuit Complexity Approach to Transductions (Q2946331) (← links)
- (Q5089205) (← links)
- (Q5109522) (← links)
- (Q5111267) (← links)
