Pages that link to "Item:Q3260847"
From MaRDI portal
The following pages link to On certain formal properties of grammars (Q3260847):
Displaying 50 items.
- On stochastic context-free languages (Q2548861) (← links)
- Problem-solving machines for Euclidean geometry (Q2549937) (← links)
- On the generative power of transformational grammars (Q2557127) (← links)
- Finding the smallest binarization of a CFG is NP-hard (Q2637648) (← links)
- A context-free language for binary multinomial processing tree models (Q2654150) (← links)
- Set automata (Q2814837) (← links)
- On the Formalization of Some Results of Context-Free Language Theory (Q2820703) (← links)
- When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science (Q2963950) (← links)
- A pumping lemma for flip-pushdown languages (Q2969981) (← links)
- ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING (Q3062792) (← links)
- Closing the Circle: An Analysis of Emil Post's Early Work (Q3430940) (← links)
- Jumping Grammars (Q3455751) (← links)
- A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS (Q3526539) (← links)
- ECONOPHYSICS AND ECONOMIC COMPLEXITY (Q3603959) (← links)
- Minimum description length modelling of musical structure (Q3653346) (← links)
- On some constructions of grammars for linear languages (Q3732973) (← links)
- Composition of relational productions for plans and programs (Q3853103) (← links)
- Stochastic grammars and languages (Q4045668) (← links)
- Size, index, and context-sensitivity of controlled partition grammars (Q4139706) (← links)
- COMPUTERIZED METHODOLOGY FOR THE EVALUATION OF LEVEL OF KNOWLEDGE (Q4275315) (← links)
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic (Q4372922) (← links)
- (Q4404453) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Fast uniform analysis of Coupled-Context-Free languages (Q4632444) (← links)
- INDUCTIVE COMPOSITION OF NUMBERS WITH MAXIMUM, MINIMUM, AND ADDITION: A New Theory for Program Execution-Time Analysis (Q4652794) (← links)
- Representations of the language recognition problem for a theorem prover (Q4770508) (← links)
- On weak growing context-sensitive grammars (Q5096331) (← links)
- Queue Automata: Foundations and Developments (Q5112182) (← links)
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars (Q5158664) (← links)
- Non-Self-Embedding Grammars and Descriptional Complexity (Q5164870) (← links)
- Automatic Sequences and Generalised Polynomials (Q5222169) (← links)
- On the Computational Complexity of Algorithms (Q5339741) (← links)
- Efficient parallel and incremental parsing of practical context-free languages (Q5371946) (← links)
- An efficient syntactic analyser of certain formal languages (Q5537609) (← links)
- Control sets on grammars (Q5539750) (← links)
- (Q5541335) (← links)
- The theory of languages (Q5551468) (← links)
- A universal compiler system based on production rules (Q5567440) (← links)
- Context-free languages and rudimentary attributes (Q5569455) (← links)
- An improved proof for a theorem of N. Chomsky (Q5573389) (← links)
- A Note on Pushdown Store Automata and Regular Systems (Q5573974) (← links)
- The theory of languages (Q5592247) (← links)
- Zwei Operationen zwischen Chomsky‐Grammatiken (Q5598351) (← links)
- Characterizations and extensions of pushdown translations (Q5621954) (← links)
- Context-sensitive immediate constituent analysis: Context-free languages revisited (Q5663375) (← links)
- An Extension of Complex Role Inclusion Axioms in the Description Logic $\mathcal{SROIQ}$ (Q5747785) (← links)
- Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata (Q5859666) (← links)
- On computational complexity of set automata (Q5918383) (← links)
- Comments on: ``Latent Markov models: a review of a general framework for the analysis of longitudinal data with covariates'' (Q5971369) (← links)
- A simple logic of concepts (Q6156201) (← links)