scientific article; zbMATH DE number 794243
From MaRDI portal
Publication:4847003
zbMath0839.68053MaRDI QIDQ4847003
Publication date: 10 September 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (22)
Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy ⋮ Descendants of a recognizable tree language for sets of linear monadic term rewrite rules ⋮ Linear generalized semi-monadic rewrite systems effectively preserve recognizability ⋮ Some decidability results on one-pass reductions ⋮ Test sets for the universal and existential closure of regular tree languages. ⋮ Decidability for left-linear growing term rewriting systems. ⋮ Term rewriting restricted to ground terms. ⋮ Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems ⋮ A theoretical limit for safety verification techniques with regular fix-point computations ⋮ Closure of Tree Automata Languages under Innermost Rewriting ⋮ Equational approximations for tree automata completion ⋮ Murg term rewrite systems ⋮ Reachability analysis over term rewriting systems ⋮ Termination criteria for tree automata completion ⋮ The HOM Problem is EXPTIME-Complete ⋮ TAGED Approximations for Temporal Properties Model-Checking ⋮ Some undecidability results concerning the property of preserving regularity ⋮ Handling Left-Quadratic Rules When Completing Tree Automata ⋮ How to Tackle Integer Weighted Automata Positivity ⋮ A property of left-linear rewrite systems preserving recognizability ⋮ Towards an Efficient Implementation of Tree Automata Completion ⋮ Iterating transducers
This page was built for publication:
