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.
- Stack and register complexity of radix conversions (Q2272392) (← links)
- The Riemann hypothesis in computer science (Q2286749) (← links)
- On decidability and closure properties of language classes with respect to bio-operations (Q2311220) (← links)
- On the overlap assembly of strings and languages (Q2311303) (← links)
- Finite degree clones are undecidable (Q2333801) (← links)
- Some complexity results for stateful network verification (Q2335903) (← links)
- The stability of the deterministic Skorokhod problem is undecidable (Q2339927) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Tag systems and lag systems (Q2395198) (← links)
- Uncountable realtime probabilistic classes (Q2400994) (← links)
- Deletion operations on deterministic families of automata (Q2407104) (← links)
- On counting functions and slenderness of languages (Q2422037) (← links)
- Insertion operations on deterministic reversal-bounded counter machines (Q2424688) (← links)
- Isomorphisms of scattered automatic linear orders (Q2446106) (← links)
- A framework for linear authorization logics (Q2449046) (← 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)
- Language models for some extensions of the Lambek calculus (Q2672665) (← links)
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
- Infinitary action logic with multiplexing (Q2698280) (← links)
- Domain-Free<i>λµ</i>-Calculus (Q2729625) (← links)
- Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
- The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
- Programs=data=first-class citizens in a computational world (Q2941589) (← links)
- Minsky Machines and Algorithmic Problems (Q2947180) (← links)
- A rewriting framework and logic for activities subject to regulations (Q2973251) (← 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)
- An Alternative Direct Simulation of Minsky Machines into Classical Bunched Logics via Group Semantics (Q3178265) (← links)
- Reachability in Succinct and Parametric One-Counter Automata (Q3184686) (← links)
- Many-one degrees associated with problems of tag (Q3214909) (← links)
- Playing with Repetitions in Data Words Using Energy Games (Q3300789) (← links)
- From Mathesis Universalis to Provability, Computability, and Constructivity (Q3305633) (← 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)