Results 281 to 290 of about 2,427,716 (339)
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
Diplomatic language and formal language:
2021Jusqu’au début du XXe siècle, la langue utilisée en diplomatie tire ses racines de la langue de cour, plus particulièrement celle de Louis XIV, ce qui explique la place du français comme langue diplomatique. Cet article propose une mise en perspective historique et anthropologique des formes d’expression du diplomate et montre pourquoi le langage ...
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 +2 more sources
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 Models of Language Learning
Cognition, 1979Abstract Research is reviewed that addresses itself to human language learning by developing precise, mechanistic models that are capable in principle of acquiring languages on the basis of exposure to linguistic data. Such research includes theorems on language learnability from mathematical linguistics, computer models of language acquisition from ...
openaire +2 more sources
2023
AbstractA restricted version of the higher-order logic motivated in the previous chapter is introduced. The language includes variables in the position of sentences, and quantifiers binding them; these propositional quantifiers can be used to formalize talk of propositions.
openaire +1 more source
AbstractA restricted version of the higher-order logic motivated in the previous chapter is introduced. The language includes variables in the position of sentences, and quantifiers binding them; these propositional quantifiers can be used to formalize talk of propositions.
openaire +1 more source
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
Formal specification languages
Electronics and Power, 1986Bugs in computer software are still commonplace. The problem is often due to inadequate specification of the requirements. Formal specification is proposed as a solution, but is it practical?
John Parker, Graham Titterington
openaire +1 more source
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
Formal Languages and Formal Logic
1994Throughout this book we use sentences of formal logic to describe properties of words over a finite alphabet A. A sentence will thus define a language \(L \subseteq A^{*}\); L is the set of all words that have the property described by the sentence.
openaire +1 more source