Results 261 to 270 of about 112,498 (311)

Adaptation and validation of the Intrinsic Motivation Inventory (IMI) in Polish. [PDF]

Front Psychol
Enko J, Kościelniak M.
europepmc   +1 more source

Processing effects of L1/L2 from L3 in translation recognition paradigm: an exploratory ERP study. [PDF]

Front Psychol
Zhaksylykkyzy K, Ibrayeva ZK, Kustubayeva AM, Roehm D, Zholdassova M.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Recoverable Formal Language

Problems of Information Transmission, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Topologies on formal languages

Mathematical Systems Theory, 1975
S. Y. Kuroda has shown that it is possible to attack problems concerning syntactic analysis and translation by means of topological concepts and methods. He presented a way to introduce topologies on context-free languages via the generating grammar, by considering all extensions of nonterminal derivations.
openaire   +2 more sources

The formal language of recursion

The Journal of Symbolic Logic, 1989
This is the first of a sequence of papers in which we will develop a foundation for the theory of computation based on a precise, mathematical notion of abstract algorithm . To understand the aim of this program, one should keep in mind clearly the distinction between an algorithm and the ...
openaire   +1 more source

Word Blending in Formal Languages*

Fundamenta Informaticae, 2019
In this paper we define and investigate a binary word operation that formalizes an experimentally observed outcome of DNA computations, performed to generate a small gene library, and implemented using a DNA recombination technique called Cross-pairing Polymerase Chain Reaction (XPCR).
Srujan Kumar Enaganti, Lila Kari, Timothy Ng 0001, Zihao Wang   +3 more
openaire   +1 more source

Learning of Fuzzy Formal Language

IEEE Transactions on Systems, Man, and Cybernetics, 1973
A learning model of fuzzy formal language is proposed and discussed. We continue training the learning machine by giving sets of sentences sequentially. As a result of parsing of the given teaching sentences, the learning machine reinforces fuzzy grades of membership of productions in an inherent fuzzy grammar of the machine.
Shinichi Tamura, Kokichi Tanaka
openaire   +2 more sources

Introduction to Formal Languages

1977
1.1. Let A be any abstract set. We call A an alphabet. Finite sequences of elements of A are called expressions in A. Finite sequences of expressions are called texts.
openaire   +1 more source