A property of left-linear rewrite systems preserving recognizability
From MaRDI portal
Publication:1575563
DOI10.1016/S0304-3975(00)00039-6zbMath0944.68082MaRDI QIDQ1575563
Sándor Vágvölgyi, Pál Gyenizse
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q42: Grammars and rewriting systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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