A canonical automaton for one-rule length-preserving string rewrite systems (Q498407): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q45
@@ Property / Mathematics Subject Classification ID: 68Q45 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q42
@@ Property / Mathematics Subject Classification ID: 68Q42 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6485816
@@ Property / zbMATH DE Number: 6485816 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+string rewrite system
@@ Property / zbMATH Keywords: string rewrite system / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+rational transduction
@@ Property / zbMATH Keywords: rational transduction / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ic.2015.07.002
+Normal rank
@@ Property / OpenAlex ID @@
+W1924695559
@@ Property / OpenAlex ID: W1924695559 / rank @@
+Normal rank
@@ Property / cites work @@
+Semi-commutations
@@ Property / cites work: Semi-commutations / rank @@
+Normal rank
@@ Property / cites work @@
+Semicommutations and algebraic languages
@@ Property / cites work: Semicommutations and algebraic languages / rank @@
+Normal rank
@@ Property / cites work @@
+Term Rewriting and Applications
@@ Property / cites work: Term Rewriting and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q4079524
@@ Property / cites work: Q4079524 / rank @@
+Normal rank
@@ Property / cites work @@
+On Relations Defined by Generalized Finite Automata
+Normal rank
@@ Property / cites work @@
+Decidability of Termination of Grid String Rewriting Rules
+Normal rank
@@ Property / cites work @@
+Q4447248
@@ Property / cites work: Q4447248 / rank @@
+Normal rank
@@ Property / cites work @@
+On cube-free \(\omega\)-words generated by binary morphisms
+Normal rank
@@ Property / cites work @@
+Termination and derivational complexity of confluent one-rule string-rewriting systems
+Normal rank
@@ Property / cites work @@
+Q3998014
@@ Property / cites work: Q3998014 / rank @@
+Normal rank
@@ Property / cites work @@
+One-rule semi-Thue systems with loops of length one, two or three
+Normal rank
@@ Property / cites work @@
+One-Rule Length-Preserving Rewrite Systems and Rational Transductions
+Normal rank
@@ Property / cites work @@
+Semi-Thue systems with an inhibitor
@@ Property / cites work: Semi-Thue systems with an inhibitor / rank @@
+Normal rank
@@ Property / cites work @@
+On lexicographic semi-commutations
@@ Property / cites work: On lexicographic semi-commutations / rank @@
+Normal rank
@@ Property / cites work @@
+Term Rewriting and Applications
@@ Property / cites work: Term Rewriting and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Peg-solitaire, string rewriting systems and finite automata
+Normal rank
@@ Property / cites work @@
+On the rational subsets of the free group
@@ Property / cites work: On the rational subsets of the free group / rank @@
+Normal rank
@@ Property / cites work @@
+Iteration of rational transductions
@@ Property / cites work: Iteration of rational transductions / rank @@
+Normal rank
@@ Property / cites work @@
+A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:498407