Relational phrase structure grammar applied to Mohawk constructions
Irena Bellert (1966)
Kybernetika
Similarity:
Irena Bellert (1966)
Kybernetika
Similarity:
Marcella Anselmo, Maria Madonia (2010)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et 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...
Sebastian Shaumyan (1982)
Mathématiques et Sciences Humaines
Similarity:
Martin Kutrib, Matthias Wendlandt (2014)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
We introduce and investigate several variants of a bidirectional string assembling system, which is a computational model that generates strings from copies of assembly units. The underlying mechanism is based on two-sided piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. The generative capacities and the relative power of the variants are our main interest. In particular, we prove that bidirectional string assembling system...
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.
Jürgen Dassow, Gheorghe Păun (1985)
Kybernetika
Similarity: