Publication:3741057
From MaRDI portal
zbMath0604.68057MaRDI QIDQ3741057
Publication date: 1985
68Q45: Formal languages and automata
Related Items
Undecidable event detection problems for ODEs of dimension one and two, Unnamed Item, Reachability via Cooperating Morphisms, Marked PCP is decidable, New proof for the undecidability of the circular PCP, On the \(n\)-permutation Post correspondence problem, Quasi-rocking real-time pushdown automata, Equality sets of prefix morphisms and regular star languages, Decidability of the binary infinite Post Correspondence Problem, Distances between languages and reflexivity of relations, On fixed points of rational transductions, Two techniques in the area of the star problem in trace monoids, Weighted automata on infinite words in the context of attacker-defender games, Semigroups arising from asynchronous automata., Probabilistic automata of bounded ambiguity, Word problem for deterministic and reversible semi-Thue systems, The exact complexity of the infinite Post Correspondence Problem, Extension of the decidability of the marked PCP to instances with unique blocks, Undecidability of infinite post correspondence problem for instances of size 8, Selected Decision Problems for Square-Refinement Collage Grammars, Weighted Automata on Infinite Words in the Context of Attacker-Defender Games, Undecidability of infinite post correspondence problem for instances of Size 9
