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.
- Some undecidable theories with monadic predicates and without equality (Q3931375) (← links)
- The word problem and the isomorphism problem for groups (Q3941599) (← links)
- Prefix classes of krom formulae with identity (Q3956908) (← links)
- Transductions and the parallel generation of languages<sup>†</sup> (Q3969888) (← links)
- An undecidable problem in correspondence theory (Q3984404) (← links)
- Undecidability of the identity problem for finite semigroups (Q4008756) (← links)
- The Boolean algebra of logic (Q4087168) (← links)
- (Q4125809) (← links)
- Diem-Grade Logischer Entscheidungsprobleme (Q4135479) (← links)
- Bemerkung zu Gurevich's Arbeit über das Entscheidungsproblem für Standardklassen (Q4186285) (← links)
- The undecidability of the disjunction property of propositional logics and other related problems (Q4276033) (← links)
- Parallel communicating grammar systems: the context-sensitive case (Q4297199) (← links)
- Undecidability in diagonalizable algebras (Q4338316) (← links)
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic (Q4372922) (← links)
- Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen (Q4401927) (← links)
- Inclusion is undecidable for pattern languages (Q4630269) (← links)
- New decidability results concerning two-way counter machines and applications (Q4630270) (← links)
- Quantitative Automata under Probabilistic Semantics (Q4635863) (← links)
- Expressing additives using multiplicatives and subexponentials (Q4637626) (← links)
- On the Density of Context-Free and Counter Languages (Q4640039) (← links)
- Alternation in simple devices (Q4645188) (← links)
- Characterizations of the decidability of some problems for regular trace languages (Q4729376) (← links)
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796) (← links)
- (Q4826149) (← links)
- The undecidability of second order linear logic without exponentials (Q4894725) (← links)
- System NEL is Undecidable (Q4924537) (← links)
- Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines (Q4982992) (← links)
- (Q5015208) (← links)
- On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words (Q5025066) (← links)
- (Q5089200) (← links)
- On Affine Reachability Problems (Q5089216) (← links)
- MOST SIMPLE EXTENSIONS OF ARE UNDECIDABLE (Q5100054) (← links)
- Spectra and satisfiability for logics with successor and a unary function (Q5109229) (← links)
- Comparison of max-plus automata and joint spectral radius of tropical matrices (Q5111233) (← links)
- Decidability Questions for Insertion Systems and Related Models (Q5164868) (← links)
- On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (Q5200064) (← links)
- On Synchronized Multitape and Multihead Automata (Q5200091) (← links)
- SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS (Q5247179) (← links)
- ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS (Q5249293) (← links)
- The Developments of the Concept of Machine Computability from 1936 to the 1960s (Q5250213) (← links)
- Decidability of code properties (Q5425746) (← links)
- Monogenic normal systems are universal (Q5509687) (← links)
- On the Class of Predicates Decidable by Two-Way Multitape Finite Automata (Q5514601) (← links)
- The theory of languages (Q5551468) (← links)
- Counter machines and counter languages (Q5551469) (← links)
- The undecidability of the Turing machine immortality problem (Q5559248) (← links)
- Computability by Normal Algorithms (Q5566513) (← links)
- The theory of languages (Q5592247) (← links)
- Algorithmic properties of structures (Q5600863) (← links)
- The many-one equivalence of some general combinatorial decision problems (Q5619078) (← links)