On tree automata that certify termination of left-linear term rewriting systems (Q876043): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2006.08.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111433946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3917482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis over term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Match-bounded string rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deleting string rewriting systems preserve regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2843601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability for left-linear growing term rewriting systems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of context-sensitive rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of string rewriting proved automatically / rank
 
Normal rank

Latest revision as of 17:27, 25 June 2024

scientific article
Language Label Description Also known as
English
On tree automata that certify termination of left-linear term rewriting systems
scientific article

    Statements

    On tree automata that certify termination of left-linear term rewriting systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 April 2007
    0 references
    0 references
    term rewriting systems
    0 references
    termination
    0 references
    forward closures
    0 references
    rewrite labellings
    0 references
    tree automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references