Pages that link to "Item:Q804302"
From MaRDI portal
The following pages link to The equivalence problem of multitape finite automata (Q804302):
Displaying 15 items.
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs (Q4508638) (← links)
- Inclusion is undecidable for pattern languages (Q4630269) (← links)
- (Q4720788) (← links)
- On morphically generated formal power series (Q4763925) (← links)
- On Hadamard Series and Rotating Q-Automata (Q5005101) (← links)
- A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q5055831) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- Rational and Recognisable Power Series (Q5072546) (← links)
- Decidability of equivalence for deterministic synchronized tree automata (Q5096728) (← links)
- On Synchronized Multitape and Multihead Automata (Q5200091) (← links)
- SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS (Q5247179) (← links)
- Automata, Languages and Programming (Q5716792) (← links)
- On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers (Q5744131) (← links)
- Iterative pairs and multitape automata (Q5878898) (← links)
- Direct and dual laws for automata with multiplicities (Q5958727) (← links)