scientific article
From MaRDI portal
Publication:4035665
zbMath0773.68044MaRDI QIDQ4035665
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Bottom-up tree pushdown automata: Classification and connection with rewrite systems ⋮ Undecidable properties of deterministic top-down tree transducers ⋮ Losing recognizability ⋮ Open problems in rewriting ⋮ More problems in rewriting ⋮ Linear generalized semi-monadic rewrite systems effectively preserve recognizability ⋮ One-variable context-free hedge automata ⋮ Tree automata for rewrite strategies ⋮ Some undecidability results concerning the property of preserving regularity ⋮ A property of left-linear rewrite systems preserving recognizability
This page was built for publication:
