Search results for "R language"

CODING PARTITIONS OF REGULAR SETS

2009

A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical coding partition of a regular set contains a finite number of regular classes and we give an algorithm for computing this partition. From this we derive a canonical decomposition of a regular monoid into a free product of finitely many re…

The Many Faces of a Translation

2000

First-order translations have recently been characterized as the maps computed by aperiodic single-valued nondeterministic finite transducers (NFTs). It is shown here that this characterization lifts to "V-translations" and "V-single-valued-NFTs", where V is an arbitrary monoid pseudovariety. More strikingly, 2-way V-machines are introduced, and the following three models are shown exactly equivalent to Eilenberg's classical notion of a bimachine when V is a group variety or when V is the variety of aperiodic monoids: V-translations, V-single-valued-NFTs and 2-way V-transducers.

Valoda: nozīme un forma, 6: Valodas sistēma un lietojums

2015

Rakstu krājums „Valoda: nozīme un forma. 6. Valodas sistēma un lietojums” ir Latvijas Universitātes Humanitāro zinātņu fakultātes Latviešu un vispārīgās valodniecības katedras (sadarbībā ar Baltu valodniecības katedru) 2014. gada 20. un 21. martā rīkotās 50. profesora Artura Ozola dienas starptautiskās zinātniskās konferences „Vispārīgā valodniecība: valodas sistēma un lietojums” referātu apkopojums.

Valodu mācīšanās atbalsts un tā vadība neformālajā izglītībā Latvijā

2013

Elektroniskā versija nesatur pielikumus

Valoda: nozīme un forma, 7. Gramatika un saziņa

2016

Linguistica Lettica, Nr. 26

2018

Patterns in words and languages

2004

AbstractA word p, over the alphabet of variables E, is a pattern of a word w over A if there exists a non-erasing morphism h from E∗ to A∗ such that h(p)=w. If we take E=A, given two words u,v∈A∗, we write u⩽v if u is a pattern of v. The restriction of ⩽ to aA∗, where A is the binary alphabet {a,b}, is a partial order relation. We introduce, given a word v, the set P(v) of all words u such that u⩽v. P(v), with the relation ⩽, is a poset and it is called the pattern poset of v. The first part of the paper is devoted to investigate the relationships between the structure of the poset P(v) and the combinatorial properties of the word v. In the last section, for a given language L, we consider …

Sur les Codes ZigZag et Leur Décidabilité

1990

AbstractThis paper deals with zigzag factorizations and zigzag codes. The language of “zigzag” over a regular language is represented by constructing a special family of two-way automata. Decidability of zigzag codes, previously shown for the finite languages, is proved here for all regular languages by the analysis of the set of “crossing sequences” produced by a two-way automation in the family. We also obtain that it is decidable whether or not a two-way automation of a certain type is non-ambiguous.RésuméDans ce papier on reprend les notions de factorisation zigzag et de code zigzag. On construit pour tout langage rationnel, une famille d'automates bilatéres lesquels reconnaissent les m…

On the Conceptual History of the Term Lingua Franca

2015

This paper aims to give an outline of the development of the term “Lingua Franca”. Initially the proper name of an extinct pidgin, to “Lingua Franca”, the term has become a common noun, used with regard to language contact phenomena in general – at first specifically for pidgins and trade languages, but now for all vehicular languages. This broader usage is especially prominent in the field of research known as “English as a lingua franca” (ELF). Using ELF as an example, it is shown that the modern usage is partly inconsistent and can be misleading, as it connects a positive feature of the original Lingua Franca, viz linguistic equality, with a language with native speakers like English, wh…

Learning of regular expressions by pattern matching

1995

We consider the problem of restoring regular expressions from good examples. We describe a natural learning algorithm for obtaining a “plausible” regular expression from one example. The algorithm is based on finding the longest substring which can be matched by some part of the so far obtained expression. We believe that the algorithm to a certain extent mimics humans guessing regular expressions from the same sort of examples. We show that for regular expressions of bounded length successful learning takes time linear in the length of the example, provided that the example is “good”. Under certain natural restrictions the run-time of the learning algorithm is polynomial also in unsuccessf…