Three models for the description of language
From MaRDI portal
Publication:5536272
DOI10.1109/TIT.1956.1056813zbMath0156.25401OpenAlexW2124479173WikidataQ29039295 ScholiaQ29039295MaRDI QIDQ5536272
Publication date: 1956
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1956.1056813
Related Items
Learning of Structurally Unambiguous Probabilistic Grammars, The theory of languages, Bridging the Gap Between Neurons and Cognition Through Assemblies of Neurons, Automated Conjecturing of Frobenius Numbers via Grammatical Evolution, Some formal results about stratificational grammars and their relevance to linguistics, A UNIFIED AND SYNCHRONOUS GENERATING SYSTEM FOR MULTIPLE NATURAL LANGUAGES BASED ON CFG AND SEMANTIC LANGUAGE, Parsimonious computational completeness, The grammar of mammalian brain capacity, On the effect of the IO-substitution on the Parikh image of semilinear full AFLs, Unnamed Item, Canonical systems which produce periodic sets, LARS: a learning algorithm for rewriting systems, The theory of languages, The word problem of \(\mathbb{Z}^n\) is a multiple context-free language, An approximation algorithm for quadratic dynamic systems based on N. Chomsky's grammar for Taylor's formula, On some constructions of grammars for linear languages, Applications of Weighted Automata in Natural Language Processing, Finite state models for perception, The discovery of algorithmic probability, Obituary: Ray Solomonoff, founding father of algorithmic information theory, A mathematical model for translation of natural languages, Grammatical evolution of shape and its application to structural shape optimisation, The problem of \(\Pi_{2}\)-cut-introduction, Unnamed Item, On closure properties of \(\mathcal{L}\)-valued linear languages, Languages as hyperplanes: grammatical inference with string kernels, On translating context-free grammars into Lambek grammars, Unnamed Item, Efficiency in the Identification in the Limit Learning Paradigm, Towards a Historical Notion of ‘Turing—the Father of Computer Science’, Context-sensitive immediate constituent analysis: Context-free languages revisited, A semantic framework for proof evidence, On the semantic equivalence of language syntax formalisms, Notes and note pairs in Nørgård's infinity series, Syntactic structures and recursive devices: a legacy of imprecision, A note on ambiguity in context-free grammars, Groups, graphs, languages, automata, games and second-order monadic logic, Unnamed Item, Iterative Learning of Simple External Contextual Languages, Unnamed Item, A generalised quantifier theory of natural language in categorical compositional distributional semantics with bialgebras, Multilinear representations of free pros, On the relationship between cellular automata and L-systems: The self-replication case, Immunity and pseudorandomness of context-free languages, Grammar semantics, analysis and parsing by abstract interpretation, Distributional learning of parallel multiple context-free grammars, Computation in finitary stochastic and quantum processes, Context-oriented web application protection model, On series-parallel pomset languages: rationality, context-freeness and automata, The expressivity of autosegmental grammars, Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey, Unnamed Item, On translating Lambek grammars with one division into context-free grammars, Relating attribute grammars and lexical-functional grammars, Syntax and semantics of questions, Regular combings, nonpositive curvature and the quasiconvexity of Abelian subgroups, A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting, Emergence and Universal Computation, Logical string rewriting, Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems, Families of automata characterizing context-sensitive languages, Grammar constraints, Iterative learning of simple external contextual languages, On some transformations in context-free grammars and languages, Hypergrammars: An extension of macrogrammars, Finite state and finite stop quantum languages, ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING, The multiplicative-additive Lambek calculus with subexponential and bracket modalities, On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited, Sequential fuzzy system identification, Stack-like and queue-like dynamics in recurrent neural networks, The tree-generative capacity of combinatory categorial grammars, Infinity and the foundations of linguistics, Übertragung automatentheoretischer Sätze auf Chomsky-Sprachen, Partition based real-valued encoding scheme for evolutionary algorithms, General semantics, Some problems concerning the logic of grammatical modifiers, On the complexity of a family of \(k\)-context-free sequences, L-SYSTEM DESCRIPTION OF SUBDIVISION CURVES, Language equations, Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy, Extracting symbolic knowledge from recurrent neural networks -- a fuzzy logic approach, Syntax of symbolic logic and transformational grammar, Nature computes: Information processing in quantum dynamical systems, IDL-PMCFG, a grammar formalism for describing free word order languages, Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981, Unnamed Item, From finite automata to fractal automata -- the power of recursion, A note on Parikh maps, abstract languages, and decision problems, Control sets on grammars, Operads, quasiorders, and regular languages
