Results 271 to 280 of about 112,498 (311)

Formal Languages in Logic

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: Origins and directions

20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 1979
Origins 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

Triple Dots in a Formal Language

Journal of Automated Reasoning, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Formalisms for Non-Formal Languages

1999
In 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 Models of Language Learning

Cognition, 1979
Abstract 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

Formal Languages and Formal Logic

1994
Throughout 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

“Structural connections” in formal languages

Communications of the ACM, 1964
This paper defines the concept of “structural connection” in a mechanical language in an attempt to classify various formal languages according to the complexity of parsing structures on strings in the languages. Languages discussed vary in complexity from those with essentially no structure at all to languages which are self-defining. The relationship
openaire   +2 more sources

Formal languages over GF(2)

Information and Computation, 2022
Alexander Okhotin
exaly  

The formal language theory column

Bull. EATCS, 1987
It becomes usual that ``The formal language theory column of the Bulletin of the EATCS'' deals with cryptography and the one reviewed is not an exception. It discusses the knapsack problem and illustrates its use in public key cryptography. After encrypting some plaintext about sauna (another favourite theme one can find in this column) and giving some
openaire   +1 more source

Exploring the topological entropy of formal languages

Theoretical Computer Science, 2021
Florian Starke
exaly