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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2015.07.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1924695559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-commutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semicommutations and algebraic languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relations Defined by Generalized Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Termination of Grid String Rewriting Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4447248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cube-free \(\omega\)-words generated by binary morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination and derivational complexity of confluent one-rule string-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-rule semi-Thue systems with loops of length one, two or three / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Rule Length-Preserving Rewrite Systems and Rational Transductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Thue systems with an inhibitor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lexicographic semi-commutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Peg-solitaire, string rewriting systems and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rational subsets of the free group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration of rational transductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete characterization of termination of \(0^p1^q\to 1^r0^s\) / rank
 
Normal rank

Latest revision as of 20:31, 10 July 2024

scientific article
Language Label Description Also known as
English
A canonical automaton for one-rule length-preserving string rewrite systems
scientific article

    Statements

    A canonical automaton for one-rule length-preserving string rewrite systems (English)
    0 references
    0 references
    0 references
    28 September 2015
    0 references
    0 references
    string rewrite system
    0 references
    rational transduction
    0 references
    0 references