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 50 items.
- A direct method for simulating partial recursive functions by Diophantine equations (Q1326783) (← links)
- Some decision problems for parallel communicating grammar systems (Q1341721) (← links)
- On the determinacy problem for two-way pushdown automata (Q1342261) (← links)
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors (Q1393121) (← links)
- Counter machines (Q1606993) (← links)
- The \(\exists\forall^2\) fragment of the first-order theory of atomic set constraints is \(\Pi_1^0\)-hard (Q1607043) (← links)
- \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
- On two-way nondeterministic finite automata with one reversal-bounded counter (Q1763701) (← links)
- When ambients cannot be opened (Q1770415) (← links)
- Quantum versus deterministic counter automata (Q1779306) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) (← links)
- Counter machines and verification problems. (Q1853523) (← links)
- Augmenting the discrete timed automaton with other data structures. (Q1853524) (← links)
- One-way probabilistic reversible and quantum one-counter automata. (Q1853577) (← links)
- The undecidability of the first-order theories of one step rewriting in linear canonical systems (Q1854538) (← links)
- The conformon-P system: a molecular and cell biology-inspired computability model (Q1884951) (← links)
- On two-way FA with monotonic counters and quadratic Diophantine equations (Q1884954) (← links)
- Catalytic P systems, semilinear sets, and vector addition systems (Q1884955) (← links)
- Petri nets, Horn programs, linear logic and vector games (Q1899147) (← links)
- Linear logic automata (Q1919766) (← links)
- Computational power of two stacks with restricted communication (Q1959441) (← links)
- On decision problems for parameterized machines (Q2268878) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Tag systems and lag systems (Q2395198) (← links)
- Tag systems and Collatz-like functions (Q2474075) (← links)
- Time-restricted sequence generation (Q2537897) (← links)
- What makes some language theory problems undecidable (Q2540268) (← links)
- Pushdown automata with counters (Q2554231) (← links)
- On composition and lookahead delegation of \(e\)-services modeled by automata (Q2566017) (← links)
- About \(P\) systems with symport/antiport (Q2576609) (← links)
- Sufficient-completeness, ground-reducibility and their complexity (Q2641108) (← links)
- Domain-Free<i>λµ</i>-Calculus (Q2729625) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES (Q3021942) (← links)
- One-Reversal Counter Machines and Multihead Automata: Revisited (Q3075514) (← links)
- SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES (Q3086246) (← links)
- Reachability in Succinct and Parametric One-Counter Automata (Q3184686) (← links)
- Many-one degrees associated with problems of tag (Q3214909) (← links)
- Closing the Circle: An Analysis of Emil Post's Early Work (Q3430940) (← links)
- ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS (Q3526543) (← links)
- Bad News on Decision Problems for Patterns (Q3533022) (← links)
- Counting Time in Computing with Cells (Q3618683) (← links)
- Simulations by Time-Bounded Counter Machines (Q3637243) (← links)
- Algorithmic Analysis of Array-Accessing Programs (Q3644742) (← links)
- Deciding reachability problems in Turing-complete fragments of Mobile Ambients (Q3655763) (← links)
- Register machine proof of the theorem on exponential diophantine representation of enumerable sets (Q3734384) (← links)
- Solvable problems for transformers with reversal-bounded counters (Q3747751) (← links)
- On two-way weak counter machines (Q3766856) (← links)
- Halteprobleme von Fang-Systemen (tag systems) (Q3875919) (← links)