Search results for "languages"

Phaedri Avgvsti liberti Fabvlae Aesopiae electae

1936

Contributor other: Sakārtojis un apstrādājis Verners Ābele.

Languages with mismatches and an application to approximate indexing

2005

In this paper we describe a factorial language, denoted by L(S, k,r), that contains all words that occur in a string 5 up to k mismatches every r symbols. Then we give some combinatorial properties of a parameter, called repetition index and denoted by R(S,k,r), defined as the smallest integer h ? 1 such that all strings of this length occur at most in a unique position of the text S up to k mismatches every r symbols. We prove that R(S, k, r) is a non-increasing function of r and a non-decreasing function of k and that the equation r = R(S, k, r) admits a unique solution. The repetition index plays an important role in the construction of an indexing data structure based on a trie that rep…

Žogu nosaukumi latviešu valodas izloksnēs

2002

Profesore Marta Rudzīte: personālais bibliogrāfiskais rādītājs

1984

Personālajā bibliogrāfiskajā rādītājā ar atlasi ietverti filoloģijas doktores, valodnieces, profesores M. Rudzītes darbi un literatūra par viņas dzīvi, zinātnisko, pedagoģisko un sabiedrisko darbību.

Profesore Valentīna Agamdžanova: personālais bibliogrāfiskais rādītājs

1984

Saturs: Priekšvārds. Filoloģijas zinātņu doktore profesore Valentīna Agamdžanova. Profesores Valentīnas Agamdžanovas publicētie darbi (1958.-1984.). Profesores V. Agamdžanovas rediģētie darbi. Raksti par profesori V. Agamdžanovu. Profesores V. Agamdžanovas publicēto darbu alfabētiskais rādītājs. Personu rādītājs.

Quantum inductive inference by finite automata

2008

AbstractFreivalds and Smith [R. Freivalds, C.H. Smith Memory limited inductive inference machines, Springer Lecture Notes in Computer Science 621 (1992) 19–29] proved that probabilistic limited memory inductive inference machines can learn with probability 1 certain classes of total recursive functions, which cannot be learned by deterministic limited memory inductive inference machines. We introduce quantum limited memory inductive inference machines as quantum finite automata acting as inductive inference machines. These machines, we show, can learn classes of total recursive functions not learnable by any deterministic, nor even by probabilistic, limited memory inductive inference machin…

Ambiguity and complementation in recognizable two-dimensional languages

2008

The theory of one-dimensional (word) languages is well founded and investigated since fifties. From several years, the increasing interest for pattern recognition and image processing motivated the research on two-dimensional or picture languages, and nowadays this is a research field of great interest. A first attempt to formalize the concept of finite state recognizability for two-dimensional languages can be attributed to Blum and Hewitt ([7]) who started in 1967 the study of finite state devices that can define two-dimensional languages, with the aim to finding a counterpart of what regular languages are in one dimension. Since then, many approaches have been presented in the literature…

Finite automata on timed ω-trees

2003

AbstractIn the last decade Alur and Dill introduced a model of automata on timed ω-sequences which extends the traditional models of finite automata. In this paper, we present a theory of timed ω-trees which extends both the theory of timed ω-sequences and the theory of ω-trees. The main motivation is to introduce a new way of specifying real-time systems and provide tools for studying decidability problems in related fields. We focus on the decision problems and their applications in system verification and synthesis.

RECOGNIZABLE PICTURE LANGUAGES

1992

The purpose of this paper is to propose a new notion of recognizability for picture (two-dimensional) languages extending the characterization of one-dimensional recognizable languages in terms of local languages and alphabetic mappings. We first introduce the family of local picture languages (denoted by LOC) and, in particular, prove the undecidability of the emptiness problem. Then we define the new family of recognizable picture languages (denoted by REC). We study some combinatorial and language theoretic properties of REC such as ambiguity, closure properties or undecidability results. Finally we compare the family REC with the classical families of languages recognized by four-way a…

Emotion Regulation and Identity Negotiation: A Short Story Analysis of Finnish Language Teachers’ Emotional Experiences Teaching Pupils of Immigrant …

2021

This study explores the connection between emotion regulation and teacher identity by drawing on short stories present in interviews with four Finnish language teachers working with immigrant pupil...