Infoscience
metadata only
The Complexity of Checking Non-Emptiness in Symbolic Tree Automata
We study the satisfiability problem of symbolic tree automata and decompose it into the satisfiability problem of the existential first-order theory of the input characters and the existential monadic second-order theory of the indices of the accepted words. We use our decomposition to obtain tight
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization#670411
- Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization#668346
- Quantified Propositional Gödel Logics#697298
- Cracking the Millennium Prize Problems: A Meta-Logical Approach to Mathematical Mysteries#83738
- Deciders: Transform finite strings by finite string transformation rules into {Accept, Reject}#89657
Record · ID 1134215
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive