Predicting Protein Secondary Structure Using Stochastic Tree Grammars
Machine Learning - Special issue on learning with probabilistic representations
Linear and Context-Free Graph Grammars
Journal of the ACM (JACM)
TREEBAG - a Short Presentation
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
Tree-oriented proofs of some theorems on context-free and indexed languages
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Tree-manipulating systems and Church-Rosser Theorems
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
On syntax-directed transduction and tree transducers
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Translations on a context free grammar
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Polynomial learnability and locality of formal grammars
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
Feasible learnability of formal grammars and the theory of natural language acquisition
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Tree Systems for Syntactic Pattern Recognition
IEEE Transactions on Computers
Tree parsing with synchronous tree-adjoining grammars
IWPT '11 Proceedings of the 12th International Conference on Parsing Technologies
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
TEXT LANGUAGES IN AN ALGEBRAIC FRAMEWORK
Fundamenta Informaticae
Strong lexicalization of tree adjoining grammars
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
| Hi-index | 0.00 |
In this paper we discuss still another version of indexed grammars 1 and macro grammars3,gaining some geometric intuition about the structure of these systems. An ordinary context-free grammar is a rewriting system for strings; we find that a macro grammar is a rewriting system for trees. CF grammars on strings form a special case since strings can be thought of as trees without branching nodes. We consider the special case of finite-state grammars in this report. We define the tree analogue of a non deterministic generalized sequential machine and obtain results about the domain and range of such a mapping. We relate these results to the theory of generalized finite automata6.