Pages that link to "Item:Q775202"
From MaRDI portal
The following pages link to Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines (Q775202):
Displayed 15 items.
- On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers (Q5744131) (← links)
- Weak Cost Register Automata are Still Powerful (Q5859644) (← links)
- Semilinearity of Families of Languages (Q5859668) (← links)
- Continuous One-counter Automata (Q5875944) (← links)
- Percentile queries in multi-dimensional Markov decision processes (Q5892424) (← links)
- Input-driven multi-counter automata (Q5918274) (← links)
- Recursed Is Not Recursive: A Jarring Result (Q6065458) (← links)
- On the complexity of decision problems for some classes of machines and applications (Q6077841) (← links)
- On some algebraic ways to calculate zeros of the Riemann zeta function (Q6108716) (← links)
- Generalizations of Checking Stack Automata: Characterizations and Hierarchies (Q6114832) (← links)
- Computing with chemical reaction networks: a tutorial (Q6150974) (← links)
- Iterated uniform finite-state transducers on unary languages (Q6165558) (← links)
- Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)
- (Q6190438) (← links)
- Iterative arrays with finite inter-cell communication (Q6195132) (← links)