Proving non-termination by finite automata (Q5277877): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Proving non-termination by finite automata
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.RTA.2015.160 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1505.00478 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1849635240 / rank
 
Normal rank
Property / title
 
Proving non-termination by finite automata (English)
Property / title: Proving non-termination by finite automata (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.RTA.2015.160 / rank
 
Normal rank

Latest revision as of 16:36, 30 December 2024

scientific article; zbMATH DE number 6744197
Language Label Description Also known as
English
Proving non-termination by finite automata
scientific article; zbMATH DE number 6744197

    Statements

    0 references
    0 references
    12 July 2017
    0 references
    non-termination
    0 references
    term rewriting
    0 references
    finite automata
    0 references
    regular languages
    0 references
    Proving non-termination by finite automata (English)
    0 references

    Identifiers