On context-free languages and push-down automata
From MaRDI portal
Publication:5735559
DOI10.1016/S0019-9958(63)90306-1zbMath0123.12502OpenAlexW1982581840MaRDI QIDQ5735559
Publication date: 1963
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(63)90306-1
Related Items
The random generation of directed animals, Two combinatorial statistics on Dyck paths, Some statistics on Dyck paths, The random generation of underdiagonal walks, A bijective proof of a Touchard-Riordan formula, Algebraic languages and polyominoes enumeration, Equivalences and transformations of regular systems - applications to recursive program schemes and grammars, ``Deco polyominoes, permutations and random generation, Unnamed Item, Iterative and recursive matrix theories, Random and uniform generation of words, A new way of counting the column-convex polyominoes by perimeter, Enumeration of the directed convex polyominoes, A representation of trees by languages. II, Unnamed Item, Automates a file, Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations, Combinatorial aspects of continued fractions, Tree-size bounded alternation, Stochastic grammars and languages, Adherences of languages, Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages, Grammar semantics, analysis and parsing by abstract interpretation, Enumeration of skew Ferrers diagrams, Asymptotic distribution of motifs in a stochastic context-free grammar model of RNA folding, The complexity of computing the number of strings of given length in context-free languages, Combinatorial analysis of tetris-like games, An Improved Proof of the Closure Under Homomorphic Inverse of FCFL Valued in Lattice-Ordered Monoids, A linear-time algorithm for the generation of trees, A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!), On translating Lambek grammars with one division into context-free grammars, Attribute grammars are useful for combinatorics, Two double-exponential gaps for automata with a limited pushdown, Tiling problems, automata, and tiling graphs, Animaux et arbres guingois. (Animals and guingois trees), Angelic processes for CSP via the UTP, The tennis ball problem, Enumeration of skew Ferrers diagrams and basic Bessel functions, An improved bound for detecting looping configurations in deterministic PDA's, On jump-deterministic pushdown automata, Combinatorial aspects of continued fractions. (Reprint), Integral Representation and Algorithms for Closed Form Summation, Direct or cascade product of pushdown automata, Un théorème de Chomsky-Schützenberger pour les forets algébriques, A representation of trees by languages. I, Periodic properties of pushdown automata, Une note sur le cylindre des langages déterministes, Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata, Linear weighted tree automata with storage and inverse linear tree homomorphisms, An Automata Characterisation for Multiple Context-Free Languages, Generating functions for column-convex polyominoes, On stochastic context-free languages, Underdiagonal lattice paths with unrestricted steps, Six etudes in generating functions, Generation, recognition and parsing of context-free languages by means of recursive graphs, Strip tiling and regular grammars, Recursion induction principle revisited, Dyck path enumeration, \(L(A)=L(B)\)? decidability results from complete formal systems, Fundamental properties of infinite trees, On reducing the number of states in a PDA, A strip-like tiling algorithm, The area determined by underdiagonal lattice paths
