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