On the regular structure of prefix rewriting
CAAP '90 Proceedings of the fifteenth colloquium on CAAP'90
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
String-rewriting systems
On Infinite Transition Graphs Having a Decidable Monadic Theory
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
A String-Rewriting Characterization of Muller and Schupp's Context-Free Graphs
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Formal Languages and Word-Rewriting
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
A Chomsky-Like Hierarchy of Infinite Graphs
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Regular Model Checking Made Simple and Efficient
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On the Transition Graphs of Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Thue Specifications, Infinite Graphs and Synchronized Product
Fundamenta Informaticae
| Hi-index | 0.00 |
We define four families of word-rewriting systems: the prefix/suffix systems and the left/right systems. The rewriting of prefix systems generalizes the prefix rewriting of systems: a system is prefix (suffix) if a left hand side and a right hand side are overlapping only by prefix (suffix). The rewriting of right systems generalizes the mechanism of transducers: a system is right (left) if a left hand side overlaps a right hand side only on the right (left). We show that these systems have a rational derivation even if they are not only finite but recognizable. Besides these four families, we give simple systems having a non rational derivation.