The goals of linguistic theory and applicative grammar
Sebastian Shaumyan (1982)
Mathématiques et Sciences Humaines
Similarity:
Displaying similar documents to “On the correct formulation of syntactic rules in ergative languages”
The goals of linguistic theory and applicative grammar
C++ Tools to construct our user-level language
Frédéric Hecht (2010)
ESAIM: Mathematical Modelling and Numerical Analysis
Similarity:
The aim of this paper is to present how to make a dedicaded computed language polymorphic and multi type, in to solve partial differential equations with the finite element method. The driving idea is to make the language as close as possible to the mathematical notation.
Structural unambiguity of formal languages
Václav Fabian (1964)
Czechoslovak Mathematical Journal
Similarity:
A description of the AS-language for the Elliott 803 computer
Krystyna Sochacz, J. Szczepkowicz (1966)
Applicationes Mathematicae
Similarity:
Classes of two-dimensional languages and recognizability conditions
Marcella Anselmo, Maria Madonia (2011)
RAIRO - Theoretical Informatics and Applications
Similarity:
The paper deals with some classes of two-dimensional recognizable languages of “high complexity”, in a sense specified in the paper and motivated by some necessary conditions holding for recognizable and unambiguous languages. For such classes we can solve some open questions related to unambiguity, finite ambiguity and complementation. Then we reformulate a necessary condition for recognizability stated by Matz, introducing a new complexity function. We solve an open question proposed...