Pages that link to "Item:Q1275469"
From MaRDI portal
The following pages link to A construction on finite automata that has remained hidden (Q1275469):
Displaying 13 items.
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (Q703577) (← links)
- Extraction and recoding of input-\(\varepsilon\)-cycles in finite state transducers. (Q1426170) (← links)
- Lexicographic decomposition of \(k\)-valued transducers (Q1959399) (← links)
- On the representation of finite deterministic 2-tape automata (Q1960654) (← links)
- Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
- A Disambiguation Algorithm for Finite Automata and Functional Transducers (Q2914715) (← links)
- Series which are both max-plus and min-plus rational are unambiguous (Q3374753) (← links)
- On the Decidability of the Equivalence for k-Valued Transducers (Q3533016) (← links)
- On the Decidability of the Equivalence for a Certain Class of Transducers (Q3637249) (← links)
- How expressions can code for automata (Q4680737) (← links)
- (Q5090506) (← links)
- ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS (Q5401560) (← links)
- From Muller to parity and Rabin qutomata: optimal transformations preserving (history) determinism (Q6566473) (← links)
