A grammar of the Aramaic idiom contained in the Babylonian Talmud : with constant reference to Gaonic literature

C. Levias

The principles of Hebrew grammar

by J. P. N. Land. Transl. from the Dutch by Reginald Lane Poole

A grammar of the Hebrew language

by Hyman Hurwitz

A Hebrew grammar

by the rev. C. T. Wood. With the co-operation of H. C. O. Lanchester. With an appendix on the Hebrew vowel system ...by Professor Kennett

Grammar of the Palestinian Jewish Aramaic

by Wm. B. Stevenson

A grammar of Mishnaic Hebrew

by M. H. Segal

Manual of the Aramaic language of the Palestinian Talmud : grammar, vocalized text, translation and vocabulary

by the late J. T. Marshall. Ed. from the author's ms. by J. Barton Turner. With introduction by A. Mingana

The supposed Hebraisms in the grammar of the biblical Aramaic

Berkely, Univ. of California, Diss. 1905

Book review: An Essay on Grammar-Parser Relations (J. van de Koot)

Review of this book, that is the author's Thesis Dissertation.

Grammar-Guided Evolutionary Construction of Bayesian networks

This paper proposes the EvoBANE system. EvoBANE automatically generates Bayesian networks for solving special-purpose problems. EvoBANE evolves a population of individuals that codify Bayesian networks until it finds near optimal individual that solves a given classification problem. EvoBANE has the flexibility to modify the constraints that condition the solution search space, self-adapting to the specifications of the problem to be solved. The system extends the GGEAS architecture. GGEAS is a general-purpose grammar-guided evolutionary automatic system, whose modular structure favors its application to the automatic construction of intelligent systems. EvoBANE has been applied to two classification benchmark datasets belonging to different application domains, and statistically compared with a genetic algorithm performing the same tasks. Results show that the proposed system performed better, as it manages different complexity constraints in order to find the simplest solution that best solves every problem.

On the Degree of Team Cooperation in CD Grammar Systems.

In this paper, we introduce a dynamical complexity measure, namely the degree of team cooperation, in the aim of investigating "how much" the components of a grammar system cooperate when forming a team in the process of generating terminal words. We present several results which strongly suggest that this measure is trivial in the sense that the degree of team cooperation of any language is bounded by a constant. Finally, we prove that the degree of team cooperation of a given cooperating/distributed grammar system cannot be algorithmically computed and discuss a decision problem.