Ordered term tree languages which are polynomial time inductively inferable from positive data - Concepedia

Concepedia

Publication | Closed Access

Ordered term tree languages which are polynomial time inductively inferable from positive data

28

Citations

8

References

2005

Year

Yusuke Suzuki, Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miyahara

Theoretical Computer Science

TreebanksTree LanguageCombinatorics On WordSyntaxEngineeringPositive DataOrder TheoryComputational LinguisticsComputational ComplexityTree AutomatonComputer ScienceDiscrete MathematicsLanguage StudiesPolynomial TimeLinguistics

References

	Year	Citations

Page 1

Page 1