Three models for the description of language

Cited In (98)

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

This page was built for publication: Three models for the description of language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5536272)