On the correct formulation of syntactic rules in ergative languages
S. Shaumyan (1982)
Mathématiques et Sciences Humaines
Similarity:
Displaying similar documents to “Analyses of languages accepted by varietor machines in category”
On the correct formulation of syntactic rules in ergative languages
The goals of linguistic theory and applicative grammar
Sebastian Shaumyan (1982)
Mathématiques et Sciences Humaines
Similarity:
Algebra grammars
Radim Bělohlávek (1995)
Acta Mathematica et Informatica Universitatis Ostraviensis
Similarity:
Formal languages in dynamical systems
Günter Troll (1993)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
On simple representations of language families
K. Culik II, H. A. Maurer (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Formal Languages - Concatenation and Closure
Michał Trybulec (2007)
Formalized Mathematics
Similarity:
Formal languages are introduced as subsets of the set of all 0-based finite sequences over a given set (the alphabet). Concatenation, the n-th power and closure are defined and their properties are shown. Finally, it is shown that the closure of the alphabet (understood here as the language of words of length 1) equals to the set of all words over that alphabet, and that the alphabet is the minimal set with this property. Notation and terminology were taken from [5] and [13]. MML identifier:...