Towards an Efficient Implementation of Tree Automata Completion (Q5505416): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Rewriting Approximations for Fast Prototyping of Static Analyzers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handling Algebraic Properties in Automatic Analysis of Security Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability analysis over term rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4847003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank

Latest revision as of 23:48, 28 June 2024

scientific article; zbMATH DE number 5498130
Language Label Description Also known as
English
Towards an Efficient Implementation of Tree Automata Completion
scientific article; zbMATH DE number 5498130

    Statements

    Identifiers