A property of left-linear rewrite systems preserving recognizability

DOI10.1016/S0304-3975(00)00039-6zbMath0944.68082MaRDI QIDQ1575563

Pál Gyenizse, Sándor Vágvölgyi

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

rewrite systemstree automatasets of descendantsrecognizability preserving

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Losing recognizability ⋮ Term rewriting restricted to ground terms.

Cites Work

• Reductions in tree replacement systems
• Deterministic tree pushdown automata and monadic tree rewriting systems
• Linear generalized semi-monadic rewrite systems effectively preserve recognizability
• Some undecidability results concerning the property of preserving regularity
• Bottom-up tree pushdown automata: Classification and connection with rewrite systems
• Tree generating regular systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A property of left-linear rewrite systems preserving recognizability