Results 251 to 260 of about 1,997,974 (296)
Some of the next articles are maybe not open access.
Problems of Information Transmission, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
The formal language of recursion
The Journal of Symbolic Logic, 1989This 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 +2 more sources
Topologies on formal languages
Mathematical Systems Theory, 1975S. 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
Learning of Fuzzy Formal Language
IEEE Transactions on Systems, Man, and Cybernetics, 1973A 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 +3 more sources
Word Blending in Formal Languages*
Fundamenta Informaticae, 2019In 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 +3 more
openaire +1 more source
Introduction to Formal Languages
19771.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
Formal languages: Origins and directions
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 1979Origins of the theory of formal languages and automata are surveyed starting from 1936 with the work of Turing and Post. Special attention is given to the machine translation projects of the 1950s and early 1960s and associated work in mathematical linguistics.
openaire +3 more sources
2012
Formal languages are widely regarded as being above all mathematical objects and as producing a greater level of precision and technical complexity in logical investigations because of this. Yet defining formal languages exclusively in this way offers only a partial and limited explanation of the impact which their use (and the uses of formalisms more ...
openaire +2 more sources
Formal languages are widely regarded as being above all mathematical objects and as producing a greater level of precision and technical complexity in logical investigations because of this. Yet defining formal languages exclusively in this way offers only a partial and limited explanation of the impact which their use (and the uses of formalisms more ...
openaire +2 more sources
Formalisms for Non-Formal Languages
1999In recent decades computer scientists, linguists, and philosophers converged on offering what are called formal representations of natural languages. In this essay I wish to go back to some earlier work that Dov Gabbay and I did in cooperation, show its significance, and tie it to more recent work that I did on lexical semantics, showing that the early
openaire +1 more source
Triple Dots in a Formal Language
Journal of Automated Reasoning, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources