Losing recognizability

DOI10.1016/j.tcs.2007.03.050zbMath1121.68061OpenAlexW2912451887MaRDI QIDQ2373716

Sándor Vágvölgyi

Publication date: 16 July 2007

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.050

zbMATH Keywords

rewrite systemstree automatasets of descendantsrecognizability preserving

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A property of left-linear rewrite systems preserving recognizability
• Tree generating regular systems

This page was built for publication: Losing recognizability