Pages that link to "Item:Q5536272"
From MaRDI portal
The following pages link to Three models for the description of language (Q5536272):
Displaying 50 items.
- Operads, quasiorders, and regular languages (Q256333) (← links)
- The grammar of mammalian brain capacity (Q290555) (← links)
- On the effect of the IO-substitution on the Parikh image of semilinear full AFLs (Q302175) (← links)
- An approximation algorithm for quadratic dynamic systems based on N. Chomsky's grammar for Taylor's formula (Q338010) (← links)
- Grammatical evolution of shape and its application to structural shape optimisation (Q382039) (← links)
- Languages as hyperplanes: grammatical inference with string kernels (Q413838) (← links)
- Syntactic structures and recursive devices: a legacy of imprecision (Q438595) (← links)
- Groups, graphs, languages, automata, games and second-order monadic logic (Q444388) (← links)
- Distributional learning of parallel multiple context-free grammars (Q479454) (← links)
- On translating Lambek grammars with one division into context-free grammars (Q511445) (← links)
- Immunity and pseudorandomness of context-free languages (Q653340) (← links)
- Grammar semantics, analysis and parsing by abstract interpretation (Q655410) (← links)
- The expressivity of autosegmental grammars (Q667923) (← links)
- Regular combings, nonpositive curvature and the quasiconvexity of Abelian subgroups (Q686014) (← links)
- On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
- Parsimonious computational completeness (Q832917) (← links)
- On translating context-free grammars into Lambek grammars (Q902051) (← links)
- A note on ambiguity in context-free grammars (Q911784) (← links)
- Computation in finitary stochastic and quantum processes (Q933429) (← links)
- Iterative learning of simple external contextual languages (Q982646) (← links)
- Extracting symbolic knowledge from recurrent neural networks -- a fuzzy logic approach (Q1037850) (← links)
- Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981 (Q1054158) (← links)
- A note on Parikh maps, abstract languages, and decision problems (Q1065555) (← links)
- A mathematical model for translation of natural languages (Q1119398) (← links)
- Relating attribute grammars and lexical-functional grammars (Q1194806) (← links)
- Nonterminals versus homomorphisms in defining languages for some classes of rewriting systems (Q1220388) (← links)
- Hypergrammars: An extension of macrogrammars (Q1234592) (← links)
- Sequential fuzzy system identification (Q1255466) (← links)
- The discovery of algorithmic probability (Q1370859) (← links)
- The word problem of \(\mathbb{Z}^n\) is a multiple context-free language (Q1647858) (← links)
- Obituary: Ray Solomonoff, founding father of algorithmic information theory (Q1662560) (← links)
- The problem of \(\Pi_{2}\)-cut-introduction (Q1680562) (← links)
- A semantic framework for proof evidence (Q1701039) (← links)
- Context-oriented web application protection model (Q1733478) (← links)
- On series-parallel pomset languages: rationality, context-freeness and automata (Q1734519) (← links)
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey (Q1736791) (← links)
- Families of automata characterizing context-sensitive languages (Q1772107) (← links)
- On the relationship between cellular automata and L-systems: The self-replication case (Q1963447) (← links)
- A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting (Q1998863) (← links)
- The multiplicative-additive Lambek calculus with subexponential and bracket modalities (Q2035845) (← links)
- The tree-generative capacity of combinatory categorial grammars (Q2051866) (← links)
- Infinity and the foundations of linguistics (Q2052645) (← links)
- Language equations (Q2074222) (← links)
- IDL-PMCFG, a grammar formalism for describing free word order languages (Q2093024) (← links)
- From finite automata to fractal automata -- the power of recursion (Q2104137) (← links)
- On the semantic equivalence of language syntax formalisms (Q2202012) (← links)
- Grammar constraints (Q2267808) (← links)
- Partition based real-valued encoding scheme for evolutionary algorithms (Q2311254) (← links)
- Faster shift-reduce constituent parsing with a non-binary, bottom-up strategy (Q2321341) (← links)
- LARS: a learning algorithm for rewriting systems (Q2384128) (← links)
