Pages that link to "Item:Q5096179"
From MaRDI portal
The following pages link to On the equivalence problem for deterministic multitape automata and transducers (Q5096179):
Displaying 9 items.
- The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata (Q2271426) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)
- Equivalence checking of prefix-free transducers and deterministic two-tape automata (Q2278270) (← links)
- LABELLING MULTI-TAPE AUTOMATA WITH CONSTRAINED SYMBOL CLASSES (Q3503099) (← links)
- The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape (Q3564880) (← links)
- On equivalence and uniformisation problems for finite transducers (Q4598267) (← links)
- (Q4720788) (← links)
- (Q5090989) (← links)
- (Q5186756) (← links)