Rigid tree automata and applications (Q553317): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.2010.11.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094342038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile values, new names, and secure communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure properties and decision problems of dag automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving via General Matings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality and disequality constraints on direct subterms in tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly Pushdown Languages and Term Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree automata with one memory set constraints and cryptographic protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Security properties: two agents are sufficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly Tree Automata with Memory and Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata for reduction properties solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Protocol Verification Via Rigid/Flexible Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability of a Spatial Logic with Tree Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Automata with Global Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding \(\mathcal H_1\) by resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree automata with equality constraints modulo equational theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic tree pushdown automata and monadic tree rewriting systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Haskell overloading is DEXPTIME-complete / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:51, 4 July 2024

scientific article
Language Label Description Also known as
English
Rigid tree automata and applications
scientific article

    Statements

    Rigid tree automata and applications (English)
    0 references
    0 references
    0 references
    0 references
    27 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    tree automata
    0 references
    symbol constraints
    0 references
    term rewriting
    0 references
    verification
    0 references
    0 references