On the public citation graph

Propositional Tree Automata

0 signed · 44 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118032916openalex-snapshot
Theory of Computational Complexity
inferredcites →https://doi.org/10.1007/10721959openalex-snapshot
Automated deduction - CADE-17 : 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000 : proceedings
inferredcites →https://doi.org/10.1007/10721959_21openalex-snapshot
Rewriting for Cryptographic Protocol Verification
inferredcites →https://doi.org/10.1007/11513988_27openalex-snapshot
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications
inferredcites →https://doi.org/10.1007/11562948_19openalex-snapshot
A Static Analysis Using Tree Automata for XML Access Control
inferredcites →https://doi.org/10.1007/11591191_24openalex-snapshot
Monotone AC-Tree Automata
inferredcites →https://doi.org/10.1007/11805618_5openalex-snapshot
Propositional Tree Automata
inferredcites →https://doi.org/10.1007/3-540-44622-2_19openalex-snapshot
Disjunctive Tautologies as Synchronisation Schemes
inferredcites →https://doi.org/10.1007/3-540-44802-0_38openalex-snapshot
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
inferredcites →https://doi.org/10.1007/3-540-44881-0_14openalex-snapshot
Two-Way Equational Tree Automata for AC-Like Theories: Decidability and Closure Properties
inferredcites →https://doi.org/10.1007/3-540-45587-6_16openalex-snapshot
Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs
inferredcites →https://doi.org/10.1007/3-540-45610-4_9openalex-snapshot
Decidability and Closure Properties of Equational Tree Languages
inferredcites →https://doi.org/10.1007/3-540-45653-8_1openalex-snapshot
Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
inferredcites →https://doi.org/10.1007/978-3-642-59136-5_3openalex-snapshot
Context-Free Languages and Pushdown Automata
inferredcites →https://doi.org/10.1007/bfb0032738openalex-snapshot
Set-based analysis for logic programming and tree automata
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/j.entcs.2004.07.017openalex-snapshot
ACTAS : A System Design for Associative and Commutative Tree Automata Theory
inferredcites →https://doi.org/10.1016/j.tcs.2004.10.023openalex-snapshot
Multitree automata that count
inferredcites →https://doi.org/10.1016/s0019-9958(63)90306-1openalex-snapshot
On context-free languages and push-down automata
inferredcites →https://doi.org/10.1016/s0304-3975(99)00206-6openalex-snapshot
Specification and proof in membership equational logic
inferredcites →https://doi.org/10.1017/cbo9781139172752openalex-snapshot
Term Rewriting and All That
inferredcites →https://doi.org/10.11185/imt.2.433openalex-snapshot
A Static Analysis using Tree Automata for XML Access Control
inferredcites →https://doi.org/10.1145/321356.321364openalex-snapshot
On Context-Free Languages
inferredcites →https://doi.org/10.1145/351240.351242openalex-snapshot
Regular expression types for XML
inferredcites →https://doi.org/10.1145/357766.351242openalex-snapshot
Regular expression types for XML
inferredcites →https://doi.org/10.1145/773153.773169openalex-snapshot
Numerical document queries
inferredcites →https://doi.org/10.1162/089120100561610openalex-snapshot
Practical Experiments with Regular Approximation of Context-Free Languages
inferredcites →https://doi.org/10.5860/choice.38-5623openalex-snapshot
Theory of computational complexity
inferredcites →https://doi.org/10.7551/mitpress/3897.001.0001openalex-snapshot
An Introduction to Computational Learning Theory

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11814771_14openalex-snapshot
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
inferred← citeshttps://doi.org/10.1007/978-3-319-29510-7_1openalex-snapshot
Variant-Based Satisfiability in Initial Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-70590-1_10openalex-snapshot
Combining Equational Tree Automata over AC and ACI Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_18openalex-snapshot
On the Completeness of Context-Sensitive Order-Sorted Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-73859-6_12openalex-snapshot
The Maude Formal Tool Environment
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_15openalex-snapshot
Languages Modulo Normalization
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_42openalex-snapshot
Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-16310-4_2openalex-snapshot
Twenty Years of Rewriting Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-57669-4_2openalex-snapshot
Symbolic Reasoning Methods in Rewriting Logic and Maude
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.06.003openalex-snapshot
Twenty years of rewriting logic
inferred← citeshttps://doi.org/10.1109/isorc.2009.44openalex-snapshot
Fieldwork and the 4:6 Principle - Introduction to the Research Center for Verification and Semantics, AIST
showing the first 11 of 12 · page through all 12
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.