Right-linear finite path overlapping term rewriting systems effectively preserve recognizability (Q2723905)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1615242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Right-linear finite path overlapping term rewriting systems effectively preserve recognizability |
scientific article; zbMATH DE number 1615242 |
Statements
8 July 2001
0 references
0.8282678127288818
0 references
0.7946325540542603
0 references
0.7715569138526917
0 references
0.7554687857627869
0 references
Right-linear finite path overlapping term rewriting systems effectively preserve recognizability (English)
0 references
Conclusion: A new class of TRS named finite path overlapping TRS (RLFPO-TRS) is proposed. It is shown that an RLFPO-TRS effectively preserves recognizability, and that the class properly includes known decidable classes of TRSs which effectively preserve recognizability. Approximations by the proposed class are also discussed. RLFPO-TRS does not include simple EPR-TRSs such that \(R= \{f(x)\to f(f(x))\}\). To construct a tree automaton \(M_*\) which accepts \(R^*(L(M))\) for a given tree automaton \(M\), we might need an operation which ``merges'' equivalent states of a tree automaton. For the entire collection see [Zbl 0941.00035].
0 references
