Rigid tree automata and applications
From MaRDI portal
Publication:553317
DOI10.1016/J.IC.2010.11.015zbMATH Open1217.68131OpenAlexW2094342038MaRDI QIDQ553317FDOQ553317
Authors: Florent Jacquemard, Francis Klay, Camille Vacher 
Publication date: 27 July 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2010.11.015
Recommendations
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Visibly pushdown languages
- Mobile values, new names, and secure communication
- Visibly Tree Automata with Memory and Constraints
- Tree Automata with Global Constraints
- Equality and disequality constraints on direct subterms in tree automata
- Title not available (Why is that?)
- Tree automata with one memory set constraints and cryptographic protocols
- Automata for reduction properties solving
- Title not available (Why is that?)
- Security properties: two agents are sufficient
- Closure properties and decision problems of dag automata
- Deciding \(\mathcal H_1\) by resolution
- Deterministic tree pushdown automata and monadic tree rewriting systems
- Haskell overloading is DEXPTIME-complete
- Tree automata with equality constraints modulo equational theories
- Pushdown tree automata
- Protocol Verification Via Rigid/Flexible Resolution
- Visibly Pushdown Languages and Term Rewriting
- Satisfiability of a Spatial Logic with Tree Variables
- Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables
- Theorem Proving via General Matings
- Term Rewriting and Applications
Cited In (13)
- Algorithmic introduction of quantified cuts
- An Automata Theoretic Approach to Rational Tree Relations
- Emptiness and finiteness for tree automata with global reflexive disequality constraints
- Title not available (Why is that?)
- Tree Automata with Memory, Visibility and Structural Constraints
- Tree automata, (dis-)equality constraints and term rewriting. What's new?
- Compressibility of Finite Languages by Grammars
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
- Rigid Tree Automata
- Title not available (Why is that?)
- On the compressibility of finite languages and formal proofs
- Title not available (Why is that?)
- Inductive theorem proving based on tree grammars
This page was built for publication: Rigid tree automata and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553317)
