Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Authors:
J. W. Thatcher
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1967

Citing 2
Cited 32

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

Lambek Calculus Proofs and Tree Automata

LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
The Delta Operation: From Strings to Trees to Strings

Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Regularly Extended Two-Way Nondeterministic Tree Automata

CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
Context and Caterpillars and Structured Documents

PODDP '98 Proceedings of the 4th International Workshop on Principles of Digital Document Processing
Monadic Second-Order Logic and Transitive Closure Logics over Trees

Electronic Notes in Theoretical Computer Science (ENTCS)
On the minimization of XML Schemas and tree automata for unranked trees

Journal of Computer and System Sciences
Error-Correcting Tree Automata for Syntactic Pattern Recognition

IEEE Transactions on Computers
Weighted monadic datalog

Theoretical Computer Science
Languages Modulo Normalization

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Tree Automata for Non-linear Arithmetic

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Recognizability in the Simply Typed Lambda-Calculus

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Defining syntax-directed translations by tree bimorphisms

Theoretical Computer Science
Efficient inclusion checking for deterministic tree automata and XML Schemas

Information and Computation
Natural state transformations

Journal of Computer and System Sciences
The derivation language of a phrase structure grammar

Journal of Computer and System Sciences
Tree adjunct grammars

Journal of Computer and System Sciences
Generalized2 sequential machine maps

Journal of Computer and System Sciences
N-best parsing revisited

ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Some interdefinability results for syntactic constraint classes

MOL'07/09 Proceedings of the 10th and 11th Biennial conference on The mathematics of language
Formal parameters of phonology: from government phonology to SPE

ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Efficient reasoning about data trees via integer linear programming

Proceedings of the 14th International Conference on Database Theory
Closure properties of minimalist derivation tree languages

LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Minimalist tree languages are closed under intersection with recognizable tree languages

LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Solving fixed-point equations by derivation tree analysis

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Logics for unranked trees: an overview

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
Operator precedence and the visibly pushdown property

LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Efficient reasoning about data trees via integer linear programming

ACM Transactions on Database Systems (TODS)
An Automata Model for Trees with Ordered Data Values

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Operator precedence and the visibly pushdown property

Journal of Computer and System Sciences
Simplifying XML Schema: Single-type approximations of regular tree languages

Journal of Computer and System Sciences
Extending two-variable logic on data trees with order on data values and its automata

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.01

Visualization

Abstract

The recognizable sets of value trees (pseudoterms) are shown to be exactly projections of sets of derivation trees of (extended) context-free grammars.