Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
Operations Which Preserve Definability in Languages
Journal of the ACM (JACM)
Introduction to Mathematical Machine Theory
Introduction to Mathematical Machine Theory
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Finite automata and their decision problems
IBM Journal of Research and Development
A branching time logic with past operators
Journal of Computer and System Sciences
Decidable Containment of Recursive Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
The MSO Logic-Automaton Connection in Linguistics
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Decidable Fragments of Simultaneous Rigid Reachability
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Parallel Complexity of Tree Automata
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Decision Procedure for an Extension of WS1S
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Parallelism and Tree Regular Constraints
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Journal of Computer and System Sciences
Fundamental study: Tree algebras and varieties of tree languages
Theoretical Computer Science
Tight lower bounds for query processing on streaming and external memory data
Theoretical Computer Science
Deciding XPath containment with MSO
Data & Knowledge Engineering
Error-Correcting Tree Automata for Syntactic Pattern Recognition
IEEE Transactions on Computers
Tree Systems for Syntactic Pattern Recognition
IEEE Transactions on Computers
Theoretical Computer Science
Compositions of extended top-down tree transducers
Information and Computation
The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Linear delay enumeration and monadic second-order logic
Discrete Applied Mathematics
Pomset Languages of Finite Step Transition Systems
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Context-Free Languages of Countable Words
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Defining syntax-directed translations by tree bimorphisms
Theoretical Computer Science
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence
Definable transductions and weighted logics for texts
Theoretical Computer Science
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
Fragments of Monadic Second-Order Logics Over Word Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Research in the theory of inductive inference by GDR mathematicians-A survey
Information Sciences: an International Journal
A generalized approach to formal languages
Journal of Computer and System Sciences
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
Algorithmic properties of millstream systems
DLT'10 Proceedings of the 14th international conference on Developments in language theory
Theoretical Computer Science
Approximate Satisfiability and Equivalence
SIAM Journal on Computing
The model checking problem for prefix classes of second-order logic: a survey
Fields of logic and computation
Variable tree automata over infinite ranked alphabets
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Nested pebbles and transitive closure
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Tight lower bounds for query processing on streaming and external memory data
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A formal comparison of visual web wrapper generators
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Regular tree languages definable in FO
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Towards a characterization of order-invariant queries over tame structures
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
On domain-specific languages reengineering
GPCE'05 Proceedings of the 4th international conference on Generative Programming and Component Engineering
Weighted tree automata over valuation monoids and their characterization by weighted logics
Algebraic Foundations in Computer Science
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Multi-Valued MSO Logics OverWords and Trees
Fundamenta Informaticae
Subexponential time and fixed-parameter tractability: exploiting the miniaturization mapping
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Cellular automata between sofic tree shifts
Theoretical Computer Science
Hi-index | 0.02 |
This paper concerns a generalization of finite automata, the ''tree acceptors,'' which have as their inputs finite trees of symbols rather than the usual sequences of symbols. Ordinary finite automata prove to be special cases of tree acceptors, and many of the results of finite automata theory continue to hold in their appropriately generalized forms. The tree acceptors provide new characterizations of the classes of regular sets and of context-free languages. The theory of tree acceptors is applied to a decision problem of mathematical logic. It is shown here that the weak secondorder theory of two successors is decidable, thus settling a problem of Buchi. This result is in turn applied to obtain positive solutions to the decision problems for various other theories, e.g., the weak second-order theories of order types built up from the finite types, @w, and @h (the type of the rationals) by finitely many applications of the operations of order type addition, multiplication, and converse; and the weak second-order theory of locally free algebras with only unary operations.