A canonical automaton for one-rule length-preserving string rewrite systems
type: Item
instance of: scholarly article
title: A canonical automaton for one-rule length-preserving string rewrite systems
zbMATH Open document ID: 1329.68163
author: Michel Latteux
author: Yves Roos
published in: Information and Computation
publication date: 2015-09-28T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 6485816
zbMATH Keywords: string rewrite system
zbMATH Keywords: rational transduction
MaRDI profile type: Publication
full work available at URL: j.ic.2015.07.002
OpenAlex ID: W1924695559
cites work: Semi-commutations
cites work: Semicommutations and algebraic languages
cites work: Term Rewriting and Applications
cites work: Q4079524
cites work: On Relations Defined by Generalized Finite Automata
cites work: Decidability of termination of grid string rewriting rules
cites work: Q4447248
cites work: On cube-free \(\omega\)-words generated by binary morphisms
cites work: Termination and derivational complexity of confluent one-rule string-rewriting systems
cites work: Q3998014
cites work: One-rule semi-Thue systems with loops of length one, two or three
cites work: One-Rule Length-Preserving Rewrite Systems and Rational Transductions
cites work: Semi-Thue systems with an inhibitor
cites work: On lexicographic semi-commutations
cites work: Peg-solitaire, string rewriting systems and finite automata
cites work: On the rational subsets of the free group
cites work: Iteration of rational transductions
cites work: A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
DOI: 10.1016/J.IC.2015.07.002
description: scientific article; zbMATH DE number 6485816