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.
- Communication for alternating machines (Q1203600) (← links)
- On incomparable abstract family of languages (AFL) (Q1210909) (← links)
- Computation by assembly (Q1225457) (← links)
- Remarks on the complexity of nondeterministic counter languages (Q1228202) (← links)
- Finite automata with multiplication (Q1233317) (← links)
- Complexity of some problems in Petri nets (Q1238999) (← links)
- Das Entscheidungsproblem der Klasse von Formeln, die höchstens zwei Primformeln enthalten (Q1241510) (← links)
- Remarks on blind and partially blind one-way multicounter machines (Q1251070) (← links)
- Cut-type rules for calculi of general type (Q1256457) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs (Q1311976) (← links)
- Linear logic as a logic of computations (Q1326780) (← links)
- 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)
- Counter machines and distributed automata -- a story about exchanging space and time (Q1656682) (← links)
- On the complexity and decidability of some problems involving shuffle (Q1706154) (← links)
- On the decision problem for MELL (Q1733062) (← links)
- Accepting runs in a two-way finite automaton (Q1753992) (← 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)
- Grammatical characterizations of NPDAs and VPDAs with counters (Q1784750) (← 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)
- Clocked population protocols (Q2040025) (← links)
- Weighted automata (Q2074206) (← links)
- Symbolic automatic relations and their applications to SMT and CHC solving (Q2145347) (← links)
- Conway's work on iteration (Q2153969) (← links)
- On the complexity of decision problems for counter machines with applications to coding theory (Q2163996) (← links)
- First-order concatenation theory with bounded quantifiers (Q2219089) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- Modeling multitape Minsky and Turing machines by three-tape Minsky machines (Q2226960) (← links)
- Word problem for knotted residuated lattices. (Q2254319) (← links)
- Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi (Q2259003) (← links)
- On decision problems for parameterized machines (Q2268878) (← links)