Completeness results concerning systolic tree automata and E0L languages
Information Processing Letters
Languages, automata, and logic
Handbook of formal languages, vol. 3
Automata based symbolic reasoning in hardware verification
Formal Methods in System Design
Compile-Time Debugging of C Programs Working on Trees
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
The Monadic Theory of Morphic Infinite Words and Generalizations
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Algorithms for Guided Tree Automata
WIA '96 Revised Papers from the First International Workshop on Implementing Automata
MONA 1.x: New Techniques for WS1S and WS2S
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Decision Procedures for Inductive Boolean Functions Based on Alternating Automata
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Parametric Circuit Representation Using Inductive Boolean Functions
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Structural and Behavioral Modeling with Monadic Logics
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
Formal languages and their relation to automata
Formal languages and their relation to automata
Tree acceptors and some of their applications
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We define an extension of the weak monadic second-order logic of one successor (WS1S) with an infinite family of relations and show its decidability. Analogously to the decision procedure for WS1S, automata are used. But instead of using word automata, we use tree automata that accept or reject words. In particular, we encode a word in a complete leaf labeled tree and restrict the acceptance condition for tree automata to trees that encode words. As applications, we show how this extension can be applied to reason automatically about parameterized families of combinational tree-structured circuits and used to solve certain decision problems.