On certain formal properties of grammars
From MaRDI portal
Publication:3260847
DOI10.1016/S0019-9958(59)90362-6zbMath0088.10801WikidataQ55872132 ScholiaQ55872132MaRDI QIDQ3260847
Publication date: 1959
Published in: Information and Control (Search for Journal in Brave)
Related Items
A simple logic of concepts, Language learnability in the limit: a generalization of Gold's theorem, Unnamed Item, The theory of languages, Parsimonious computational completeness, The grammar of mammalian brain capacity, A universal compiler system based on production rules, Context-free languages and rudimentary attributes, An improved proof for a theorem of N. Chomsky, Jumping Grammars, Unnamed Item, COMPUTERIZED METHODOLOGY FOR THE EVALUATION OF LEVEL OF KNOWLEDGE, Characteristics of graph languages generated by edge replacement, On parsing coupled-context-free languages, Lower bound technique for length-reducing automata, Self-embedding indexed grammars, Finding the smallest binarization of a CFG is NP-hard, Linearly bounded infinite graphs, The theory of languages, On some constructions of grammars for linear languages, Zwei Operationen zwischen Chomsky‐Grammatiken, If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser, Finite state models for perception, A context-free language for binary multinomial processing tree models, Characterizations and extensions of pushdown translations, Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy, On weak growing context-sensitive grammars, Conjunctive and Boolean grammars: the true general case of the context-free grammars, The never-ending recursion, A Note on Pushdown Store Automata and Regular Systems, The context-splittable normal form for Church-Rosser language systems., Queue Automata: Foundations and Developments, When Logic Meets Engineering: Introduction to Logical Issues in the History and Philosophy of Computer Science, Context-sensitive immediate constituent analysis: Context-free languages revisited, Stochastic grammars and languages, Linear-space recognition for grammars with contexts, A pumping lemma for flip-pushdown languages, On the mathematical foundations of \textit{Syntactic structures}, Unnamed Item, A note on ambiguity in context-free grammars, Efficient parallel and incremental parsing of practical context-free languages, Position-restricted grammar forms and grammars, A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS, Innovation in gene regulation: the case of chromatin computation, A new algorithm for regularizing one-letter context-free grammars., Immunity and pseudorandomness of context-free languages, Fast uniform analysis of Coupled-Context-Free languages, Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic, On the Computational Complexity of Algorithms, Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars, Relating attribute grammars and lexical-functional grammars, INDUCTIVE COMPOSITION OF NUMBERS WITH MAXIMUM, MINIMUM, AND ADDITION: A New Theory for Program Execution-Time Analysis, Non-Self-Embedding Grammars and Descriptional Complexity, An extension of context-free grammars with one-sided context specifications, Colored operads, series on colored operads, and combinatorial generating systems, On characterization of fuzzy tree pushdown automata, On the limit set of some universal cellular automata, A syntax-specification system for patterns, Composition of relational productions for plans and programs, Size, index, and context-sensitivity of controlled partition grammars, An Extension of Complex Role Inclusion Axioms in the Description Logic $\mathcal{SROIQ}$, The derivation language of a phrase structure grammar, Context-free grammar forms, Hypergrammars: An extension of macrogrammars, Degree-languages: A new concept of acceptance, ECONOPHYSICS AND ECONOMIC COMPLEXITY, A strong pumping lemma for context-free languages, Control sets on context-free grammar forms, Finite state and finite stop quantum languages, Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition, One way finite visit automata, ON FORMAL AND COGNITIVE SEMANTICS FOR SEMANTIC COMPUTING, On computational complexity of set automata, Characterizing derivation trees of context-free grammars through a generalization of finite automata theory, Set Automata, Syntactic stochastic processes: definitions, models, and related inference problems, Infinity and the foundations of linguistics, Scattered context grammars, Properties of syntax directed translations, Automatic Sequences and Generalised Polynomials, Syntax directed translations and the pushdown assembler, On the Formalization of Some Results of Context-Free Language Theory, Zerlegungen von Semi-Thue-Systemen, Über einen Automaten mit Pufferspeicherung, Principal AFL, Generalization learning techniques for automating the learning of heuristics, Complexity problems in real time languages, Plex languages, On stochastic context-free languages, Problem-solving machines for Euclidean geometry, Minimum description length modelling of musical structure, On the generative power of transformational grammars, Closing the Circle: An Analysis of Emil Post's Early Work, Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata, Restrictions on NLC graph grammars, On the syntactic structure of protein sequences and the concept of grammar complexity, Improved normal form for grammars with one-sided contexts, Representations of the language recognition problem for a theorem prover, An efficient syntactic analyser of certain formal languages, Two-sided context specifications in formal grammars, Control sets on grammars, Comments on: ``Latent Markov models: a review of a general framework for the analysis of longitudinal data with covariates
