Abstract | ||
---|---|---|
We mainly investigate the power of weight-reducing string-rewriting systems in the context of transducing observer systems. First we relate them to a special type of restarting transducer. Then we situate them between painter and length-reducing systems. Further we show that for every weight-reducing system there is an equivalent one that uses only weight-reducing painter rules. This result enables us to prove that the class of relations that is computed by transducing observer systems with weight-reducing rules is closed under intersection. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1007/978-3-319-15579-1_57 | LATA |
Field | DocType | Citations |
Transducer,Discrete mathematics,Algebra,Computer science,Control theory,Observer (quantum physics),Hierarchy | Conference | 0 |
PageRank | References | Authors |
0.34 | 6 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Peter Leupold | 1 | 8 | 3.79 |
Norbert Hundeshagen | 2 | 21 | 4.86 |