Pages that link to "Item:Q5735559"
From MaRDI portal
The following pages link to On context-free languages and push-down automata (Q5735559):
Displayed 50 items.
- Iterative and recursive matrix theories (Q595766) (← links)
- A linear-time algorithm for the generation of trees (Q675311) (← links)
- Animaux et arbres guingois. (Animals and guingois trees) (Q688682) (← links)
- The tennis ball problem (Q696915) (← links)
- Combinatorial analysis of tetris-like games (Q941345) (← links)
- Tiling problems, automata, and tiling graphs (Q955017) (← links)
- Fundamental properties of infinite trees (Q1055184) (← links)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars (Q1098322) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- Automates a file (Q1139945) (← links)
- Achievable high scores of \(\varepsilon\)-moves and running times in DPDA computations (Q1143812) (← links)
- Combinatorial aspects of continued fractions (Q1145147) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- Adherences of languages (Q1157971) (← links)
- Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages (Q1160495) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- 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)\)!) (Q1193435) (← links)
- Attribute grammars are useful for combinatorics (Q1194317) (← links)
- Enumeration of skew Ferrers diagrams and basic Bessel functions (Q1209643) (← links)
- An improved bound for detecting looping configurations in deterministic PDA's (Q1214756) (← links)
- Direct or cascade product of pushdown automata (Q1238631) (← links)
- Un théorème de Chomsky-Schützenberger pour les forets algébriques (Q1240569) (← links)
- A representation of trees by languages. I (Q1246271) (← links)
- Une note sur le cylindre des langages déterministes (Q1254106) (← links)
- Underdiagonal lattice paths with unrestricted steps (Q1283795) (← links)
- Dyck path enumeration (Q1300974) (← links)
- The random generation of directed animals (Q1342241) (← links)
- Two combinatorial statistics on Dyck paths (Q1343781) (← links)
- Some statistics on Dyck paths (Q1347982) (← links)
- Algebraic languages and polyominoes enumeration (Q1348529) (← links)
- ``Deco'' polyominoes, permutations and random generation (Q1351210) (← links)
- A new way of counting the column-convex polyominoes by perimeter (Q1381823) (← links)
- Strip tiling and regular grammars (Q1575539) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- A strip-like tiling algorithm (Q1603720) (← links)
- Generating functions for column-convex polyominoes (Q1813084) (← links)
- Recursion induction principle revisited (Q1838286) (← links)
- The random generation of underdiagonal walks (Q1893974) (← links)
- A bijective proof of a Touchard-Riordan formula (Q1893994) (← links)
- Random and uniform generation of words (Q1917516) (← links)
- Enumeration of the directed convex polyominoes (Q1924360) (← links)
- Combinatorial aspects of continued fractions. (Reprint) (Q2497999) (← links)
- On stochastic context-free languages (Q2548861) (← links)
- Generation, recognition and parsing of context-free languages by means of recursive graphs (Q2559926) (← links)
- On reducing the number of states in a PDA (Q3948599) (← links)
- Stochastic grammars and languages (Q4045668) (← links)
- On jump-deterministic pushdown automata (Q4141220) (← links)
- (Q4147597) (← links)
- Six etudes in generating functions (Q4207899) (← links)
- Enumeration of skew Ferrers diagrams (Q6205098) (← links)