Losing recognizability
From MaRDI portal
Publication:2373716
Recommendations
Cites work
- A property of left-linear rewrite systems preserving recognizability
- Bottom-up tree pushdown automata: Classification and connection with rewrite systems
- Decision problems for term rewriting systems and recognizable tree languages
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- Layered transducing term rewriting system and its recognizability preserving property
- Linear generalized semi-monadic rewrite systems effectively preserve recognizability
- Right-linear finite path overlapping term rewriting systems effectively preserve recognizability
- Some undecidability results concerning the property of preserving regularity
- Tree generating regular systems
This page was built for publication: Losing recognizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373716)