Pages that link to "Item:Q1088414"
From MaRDI portal
The following pages link to Analytic models and ambiguity of context-free languages (Q1088414):
Displaying 50 items.
- Non-D-finite excursions in the quarter plane (Q392804) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875) (← links)
- On 3-dimensional lattice walks confined to the positive octant (Q505688) (← links)
- Walks in the quarter plane: Kreweras' algebraic model (Q558684) (← links)
- On the tiling system recognizability of various classes of convex polyominoes (Q659791) (← links)
- A decision method for Parikh slenderness of context-free languages (Q674912) (← links)
- On a class of languages with holonomic generating functions (Q728269) (← links)
- Hypergeometric expressions for generating functions of walks with small steps in the quarter plane (Q730269) (← links)
- Square lattice walks avoiding a quadrant (Q739386) (← links)
- Asymptotic approximation by regular languages (Q831785) (← links)
- Bounded languages described by GF(2)-grammars (Q832949) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.) (Q909477) (← links)
- Counting problems and algebraic formal power series in noncommuting variables (Q910245) (← links)
- Classifying lattice walks restricted to the quarter plane (Q1003654) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
- Random subgroups of Thompson's group \(F\). (Q1049914) (← links)
- Prefixes of infinite words and ambiguous context-free languages (Q1108044) (← links)
- Automatic average-case analysis of algorithms (Q1174718) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- Transcendence of binomial and Lucas' formal power series (Q1279926) (← links)
- An example of an indexed language of intermediate growth (Q1285594) (← links)
- Transcendence of formal power series with rational coefficients (Q1292488) (← links)
- A context-free language decision problem (Q1318696) (← links)
- On the language of primitive words (Q1351946) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- On universally easy classes for NP-complete problems. (Q1401418) (← links)
- Quantum automata and quantum grammars (Q1566730) (← links)
- On Hadamard square roots of unity (Q1566743) (← links)
- Basic analytic combinatorics of directed lattice paths (Q1603684) (← links)
- Context-free languages of sub-exponential growth (Q1608320) (← links)
- Congruences modulo cyclotomic polynomials and algebraic independence for \(q\)-series (Q1745153) (← links)
- Computing a context-free grammar-generating series (Q1854451) (← links)
- Walks confined in a quadrant are not always D-finite (Q1885016) (← links)
- Random palindromes: Multivariate generating function and Bernoulli density (Q1893984) (← links)
- Thin and slender languages (Q1897353) (← links)
- Random generation of finite Sturmian words (Q1917511) (← links)
- Queues, stacks, and transcendentality at the transition to chaos (Q1961669) (← links)
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865) (← links)
- Counting walks with large steps in an orthant (Q2039575) (← links)
- Number of prefixes in trace monoids: clique polynomials and dependency graphs (Q2106610) (← links)
- Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization (Q2155548) (← links)
- Calibrating generative models: the probabilistic Chomsky-Schützenberger hierarchy (Q2177476) (← links)
- On the complexity of the cogrowth sequence (Q2181189) (← links)
- The conjugacy growth of the soluble Baumslag-Solitar groups (Q2190804) (← links)
- On bounded linear codes and the commutative equivalence (Q2220842) (← links)
- On generating series of finitely presented operads (Q2255076) (← links)
- On the commutative equivalence of bounded context-free and regular languages: the semi-linear case (Q2257288) (← links)
- Counting colored planar maps: algebraicity results (Q2275895) (← links)
