A canonical automaton for one-rule length-preserving string rewrite systems
From MaRDI portal
Publication:498407
DOI10.1016/J.IC.2015.07.002zbMATH Open1329.68163OpenAlexW1924695559MaRDI QIDQ498407FDOQ498407
Authors: Michel Latteux, Yves Roos 
Publication date: 28 September 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.07.002
Recommendations
- One-rule length-preserving rewrite systems and rational transductions
- On prefixal one-rule string rewrite systems
- A complete characterization of termination of 0p 1q→1r 0s
- On termination of confluent one-rule string-rewriting systems
- Termination and derivational complexity of confluent one-rule string-rewriting systems
Cites Work
- Title not available (Why is that?)
- On Relations Defined by Generalized Finite Automata
- Title not available (Why is that?)
- Decidability of termination of grid string rewriting rules
- Semi-commutations
- On cube-free \(\omega\)-words generated by binary morphisms
- On lexicographic semi-commutations
- Semicommutations and algebraic languages
- A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
- Peg-solitaire, string rewriting systems and finite automata
- On the rational subsets of the free group
- One-rule semi-Thue systems with loops of length one, two or three
- Title not available (Why is that?)
- Iteration of rational transductions
- One-rule length-preserving rewrite systems and rational transductions
- Term Rewriting and Applications
- Term Rewriting and Applications
- Semi-Thue systems with an inhibitor
- Termination and derivational complexity of confluent one-rule string-rewriting systems
Cited In (3)
This page was built for publication: A canonical automaton for one-rule length-preserving string rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498407)
