Pages that link to "Item:Q1151753"
From MaRDI portal
The following pages link to The complexity of decision problems for finite-turn multicounter machines (Q1151753):
Displaying 9 items.
- SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS (Q5247179) (← links)
- ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS (Q5249293) (← links)
- Lossiness of communication channels modeled by transducers1 (Q5283445) (← links)
- On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers (Q5744131) (← links)
- State grammars with stores (Q5919706) (← links)
- On the complexity of decision problems for some classes of machines and applications (Q6077841) (← links)
- Unboundedness problems for machines with reversal-bounded counters (Q6091196) (← links)
- Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)
- On decision problems concerning contextual insertions and deletions (Q6652448) (← links)