scientific article; zbMATH DE number 3251418
From MaRDI portal
Publication:5536271
zbMATH Open0156.25303MaRDI QIDQ5536271FDOQ5536271
Authors: Noam Chomsky 
Publication date: 1963
Title of this publication is not available (Why is that?)
Cited In (55)
- Title not available (Why is that?)
- Inference for regular bilanguages
- On solving star equations
- The developments of the concept of machine computability from 1936 to the 1960s
- LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES
- On the relation between the class of all context-free languages and the class of deterministic context-free languages
- Microeconomic foundations of cyclical irregularities or chaos
- An efficient syntactic analyser of certain formal languages
- Title not available (Why is that?)
- Pāṇini's Grammar and Modern Computation
- Direct parsing of ID/LP grammars
- Error detection in formal languages
- Properties of probabilistic pushdown automata
- A note on some systems of lindenmayer
- Linguistic knowledge of reality: a metaphysical impossibility?
- Monads for the formalization of a pattern matching procedure
- On categories of infinite automata
- Title not available (Why is that?)
- The theory of languages
- Pushdown cellular automata
- On the structure of context-sensitive grammars
- Recursive generation of local adjunct languages
- The theory of languages
- A note onxy languages
- Categorial grammar - A basis for a natural language calculus?
- Transductions des langages de Chomsky
- A context-free language for binary multinomial processing tree models
- The nature of Soviet mathematical psychology
- Title not available (Why is that?)
- On some constructions of grammars for linear languages
- Deux applications de la représentation matricielle d'une série rationnelle non commutative. (Two applications of matrix representations of a rational non -commutative series)
- Extending Lambek grammars to basic categorial grammars
- A mathematical theory of learning transformational grammar
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- Weighted parsing for grammar-based language models over multioperator monoids
- On h-lexicalized restarting list automata
- On input-revolving deterministic and nondeterministic finite automata
- A note on ambiguity in context-free grammars
- Degrees of non-monotonicity for restarting automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- A helpful result for proving inherent ambiguity
- Approximations of cooperative equilibria in multi-person prisoners' dilemma played by cellular automata
- A linguistic approach to geometric reasoning
- Translations of network languages
- Title not available (Why is that?)
- Network languages for intelligent control
- The algebra of group kinship
- Stimulus-response theory of inite automata
- Projections between memory codes and some speech events not derivable from stimulus-response theory
- Network languages for concurrent multiagent systems
- Stochastic token theory
- A polynomial algorithm for the membership problem with categorial grammars
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
- Augmented transition networks as psychological models of sentence comprehension
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5536271)
