A Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars

Formal Grammar - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44121-3_6 ◽

2014 ◽

pp. 86-103 ◽

Cited By ~ 1

Author(s):

Makoto Kanazawa

Keyword(s):

Free Tree ◽

Context Free ◽

Indexed Grammars ◽

Linear Indexed Grammars

Download Full-text

Some results on top-context-free tree languages

Trees in Algebra and Programming — CAAP'94 - Lecture Notes in Computer Science ◽

10.1007/bfb0017480 ◽

2005 ◽

pp. 157-171 ◽

Cited By ~ 2

Author(s):

Dieter Hofbauer ◽

Maria Huber ◽

Gregory Kucherov

Keyword(s):

Tree Languages ◽

Free Tree ◽

Context Free

Download Full-text

Straight-Line Context-Free Tree Grammars

Encyclopedia of Big Data Technologies ◽

10.1007/978-3-319-77525-8_100321 ◽

2019 ◽

pp. 1594-1594

Keyword(s):

Straight Line ◽

Line Context ◽

Free Tree ◽

Context Free

Download Full-text

Distributional Learning of Simple Context-Free Tree Grammars

Lecture Notes in Computer Science - Algorithmic Learning Theory ◽

10.1007/978-3-642-24412-4_31 ◽

2011 ◽

pp. 398-412 ◽

Cited By ~ 6

Author(s):

Anna Kasprzik ◽

Ryo Yoshinaka

Keyword(s):

Distributional Learning ◽

Free Tree ◽

Context Free

Download Full-text

Complexity of Uniform Membership of Context-Free Tree Grammars

Algebraic Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-319-23021-4_16 ◽

2015 ◽

pp. 176-188 ◽

Cited By ~ 1

Author(s):

Johannes Osterholzer

Keyword(s):

Free Tree ◽

Context Free

Download Full-text

Multidimensional trees and a Chomsky–Schützenberger–Weir representation theorem for simple context-free tree grammars

Journal of Logic and Computation ◽

10.1093/logcom/exu043 ◽

2014 ◽

Vol 26 (5) ◽

pp. 1469-1516 ◽

Cited By ~ 7

Author(s):

Makoto Kanazawa

Keyword(s):

Representation Theorem ◽

Free Tree ◽

Context Free ◽

Multidimensional Trees

Download Full-text

Closure properties of linear context-free tree languages with an application to optimality theory

Theoretical Computer Science ◽

10.1016/j.tcs.2005.11.024 ◽

2006 ◽

Vol 354 (1) ◽

pp. 82-97 ◽

Cited By ~ 15

Author(s):

Stephan Kepser ◽

Uwe Mönnich

Keyword(s):

Optimality Theory ◽

Closure Properties ◽

Tree Languages ◽

Free Tree ◽

Context Free

Download Full-text

Application of the CKY Algorithm to Recognition of Tree Structures for Linear, Monadic Context-Free Tree Grammars

IEICE Transactions on Information and Systems ◽

10.1093/ietisy/e90-d.2.388 ◽

2007 ◽

Vol E90-D (2) ◽

pp. 388-394 ◽

Cited By ~ 4

Author(s):

A. FUJIYOSHI

Keyword(s):

Tree Structures ◽

Free Tree ◽

Context Free

Download Full-text

The Equivalence of Tree Adjoining Grammars and Monadic Linear Context-Free Tree Grammars

Lecture Notes in Computer Science - The Mathematics of Language ◽

10.1007/978-3-642-14322-9_11 ◽

2010 ◽

pp. 129-144

Author(s):

Stephan Kepser ◽

James Rogers

Keyword(s):

Free Tree ◽

Tree Adjoining Grammars ◽

Context Free

Download Full-text

Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages

Implementation and Application of Automata - Lecture Notes in Computer Science ◽

10.1007/978-3-319-40946-7_23 ◽

2016 ◽

pp. 273-284

Author(s):

Markus Teichmann

Keyword(s):

Regular Approximation ◽

Tree Languages ◽

Free Tree ◽

Context Free

Download Full-text

A tractable extension of Linear Indexed Grammars

10.3115/976973.976985 ◽

1995 ◽

Cited By ~ 5

Author(s):

Bill Keller ◽

David Weir

Keyword(s):

Indexed Grammars ◽

Linear Indexed Grammars

Download Full-text