scientific article; zbMATH DE number 3251418
From MaRDI portal
Publication:5536271
zbMath0156.25303MaRDI QIDQ5536271
Publication date: 1963
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The theory of languages ⋮ On solving star equations ⋮ A helpful result for proving inherent ambiguity ⋮ Microeconomic foundations of cyclical irregularities or chaos ⋮ The theory of languages ⋮ Network languages for intelligent control ⋮ On some constructions of grammars for linear languages ⋮ Degrees of non-monotonicity for restarting automata ⋮ Stochastic token theory ⋮ Network languages for concurrent multiagent systems ⋮ On categories of infinite automata ⋮ A context-free language for binary multinomial processing tree models ⋮ Unnamed Item ⋮ Categorial grammar - A basis for a natural language calculus? ⋮ A note on some systems of lindenmayer ⋮ Extending Lambek grammars to basic categorial grammars ⋮ Unnamed Item ⋮ Pāṇini's Grammar and Modern Computation ⋮ The nature of Soviet mathematical psychology ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A note on ambiguity in context-free grammars ⋮ Unnamed Item ⋮ On the structure of context-sensitive grammars ⋮ Unnamed Item ⋮ Unnamed Item ⋮ LINGUISTIC GEOMETRY: METHODOLOGY AND TECHNIQUES ⋮ Recursive generation of local adjunct languages ⋮ A polynomial algorithm for the membership problem with categorial grammars ⋮ Approximations of cooperative equilibria in multi-person prisoners' dilemma played by cellular automata ⋮ Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity ⋮ Linguistic knowledge of reality: a metaphysical impossibility? ⋮ Direct parsing of ID/LP grammars ⋮ Transductions des langages de Chomsky ⋮ A mathematical theory of learning transformational grammar ⋮ Monads for the formalization of a pattern matching procedure ⋮ Inference for regular bilanguages ⋮ Weighted parsing for grammar-based language models over multioperator monoids ⋮ The algebra of group kinship ⋮ Stimulus-response theory of inite automata ⋮ Properties of probabilistic pushdown automata ⋮ Error detection in formal 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) ⋮ On the relation between the class of all context-free languages and the class of deterministic context-free languages ⋮ Augmented transition networks as psychological models of sentence comprehension ⋮ Pushdown cellular automata ⋮ Projections between memory codes and some speech events not derivable from stimulus-response theory ⋮ On input-revolving deterministic and nondeterministic finite automata ⋮ The Developments of the Concept of Machine Computability from 1936 to the 1960s ⋮ A linguistic approach to geometric reasoning ⋮ A note onxy languages ⋮ Deterministic input-driven queue automata: finite turns, decidability, and closure properties ⋮ An efficient syntactic analyser of certain formal languages ⋮ Translations of network languages
