A polynomial algorithm testing partial confluence of basic semi-Thue systems (Q1127336): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128037015, #quickstatements; #temporary_batch_1723585310344
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Géraud Sénizergues / rank
Normal rank
 
Property / author
 
Property / author: Géraud Sénizergues / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic theory of graph reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of pre-NTS grammars is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: NTS languages are deterministic and congruential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4176990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Deciding the Equivalence Problem for 2-Tape Deterministic Finite State Acceptors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Turn Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem of multitape finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weakly confluent monadic string-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: It is decidable whether a monadic thue system is canonical over a regular set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite regular Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On deciding the confluence of a finite string-rewriting system on a given congruence class / rank
 
Normal rank
Property / cites work
 
Property / cites work: The problem of deciding confluence on a given congruence class is tractable for finite special string-rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3965569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence and inclusion problems for NTS languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of deterministic context-free languages by means of right-congruences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decision problems about controlled rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm testing partial confluence of basic semi-Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic pushdown automata is decidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence problem for deterministic finite-turn pushdown automata / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128037015 / rank
 
Normal rank

Latest revision as of 22:44, 13 August 2024

scientific article
Language Label Description Also known as
English
A polynomial algorithm testing partial confluence of basic semi-Thue systems
scientific article

    Statements

    A polynomial algorithm testing partial confluence of basic semi-Thue systems (English)
    0 references
    13 August 1998
    0 references
    semi-Thue systems
    0 references
    confluence
    0 references
    two-tape finite automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers