Pages that link to "Item:Q3260847"

The following pages link to On certain formal properties of grammars (Q3260847):

Displaying 50 items.

• The grammar of mammalian brain capacity (Q290555) (← links)
• Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
• On the mathematical foundations of \textit{Syntactic structures} (Q438597) (← links)
• Immunity and pseudorandomness of context-free languages (Q653340) (← links)
• On the syntactic structure of protein sequences and the concept of grammar complexity (Q801840) (← links)
• Parsimonious computational completeness (Q832917) (← links)
• Linearly bounded infinite graphs (Q852011) (← links)
• A note on ambiguity in context-free grammars (Q911784) (← links)
• Restrictions on NLC graph grammars (Q1059402) (← links)
• Characteristics of graph languages generated by edge replacement (Q1098320) (← links)
• Self-embedding indexed grammars (Q1099639) (← links)
• Position-restricted grammar forms and grammars (Q1160492) (← links)
• Relating attribute grammars and lexical-functional grammars (Q1194806) (← links)
• On the limit set of some universal cellular automata (Q1210540) (← links)
• A syntax-specification system for patterns (Q1210915) (← links)
• The derivation language of a phrase structure grammar (Q1225460) (← links)
• Context-free grammar forms (Q1226865) (← links)
• Hypergrammars: An extension of macrogrammars (Q1234592) (← links)
• Degree-languages: A new concept of acceptance (Q1236888) (← links)
• A strong pumping lemma for context-free languages (Q1238637) (← links)
• Control sets on context-free grammar forms (Q1238638) (← links)
• Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition (Q1240575) (← links)
• One way finite visit automata (Q1242687) (← links)
• On parsing coupled-context-free languages (Q1351955) (← links)
• The context-splittable normal form for Church-Rosser language systems. (Q1401938) (← links)
• A new algorithm for regularizing one-letter context-free grammars. (Q1426442) (← links)
• The never-ending recursion (Q1688713) (← links)
• Linear-space recognition for grammars with contexts (Q1704576) (← links)
• Innovation in gene regulation: the case of chromatin computation (Q1719985) (← links)
• Colored operads, series on colored operads, and combinatorial generating systems (Q1999730) (← links)
• On characterization of fuzzy tree pushdown automata (Q2001163) (← links)
• Syntactic stochastic processes: definitions, models, and related inference problems (Q2051758) (← links)
• Infinity and the foundations of linguistics (Q2052645) (← links)
• Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy (Q2177476) (← links)
• An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
• Improved normal form for grammars with one-sided contexts (Q2348260) (← links)
• Two-sided context specifications in formal grammars (Q2354409) (← links)
• Lower bound technique for length-reducing automata (Q2381504) (← links)
• Finite state models for perception (Q2396127) (← links)
• Finite state and finite stop quantum languages (Q2506022) (← links)
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory (Q2526960) (← links)
• Scattered context grammars (Q2532394) (← links)
• Properties of syntax directed translations (Q2532395) (← links)
• Syntax directed translations and the pushdown assembler (Q2535241) (← links)
• Zerlegungen von Semi-Thue-Systemen (Q2535856) (← links)
• Über einen Automaten mit Pufferspeicherung (Q2537131) (← links)
• Principal AFL (Q2540269) (← links)
• Generalization learning techniques for automating the learning of heuristics (Q2541846) (← links)
• Complexity problems in real time languages (Q2547547) (← links)
• Plex languages (Q2547801) (← links)