Weighted basic parallel processes and combinatorial enumeration
From MaRDI portal
Cites work
- 200 Problems on Languages, Automata, and Computation
- A calculus of communicating systems
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
- Algebra and coalgebra of stream products
- Algebra, coalgebra, and minimization in polynomial differential equations
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- Analytic combinatorics
- Automatic pre- and postconditions for partial differential equations
- Combinatorial resolution of systems of differential equations. III: A special class of differentially algebraic series
- Completeness results for generalized communication-free Petri nets with arbitrary edge multiplicities
- Complexity bounds for zero-test algorithms
- Computing representations for radicals of finitely generated differential ideals
- Constructible differentially finite algebraic series in several variables
- Constructions in Algebra
- D-finite power series
- Decision Problems of Finite Automata Design and Related Arithmetics
- Differentiably finite power series
- Differential equation invariance axiomatization
- Handbook of weighted automata
- scientific article; zbMATH DE number 4025850 (Why is no real title available?)
- scientific article; zbMATH DE number 1059894 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 1479629 (Why is no real title available?)
- scientific article; zbMATH DE number 1555184 (Why is no real title available?)
- scientific article; zbMATH DE number 2086414 (Why is no real title available?)
- scientific article; zbMATH DE number 7354705 (Why is no real title available?)
- scientific article; zbMATH DE number 7453188 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- scientific article; zbMATH DE number 3415973 (Why is no real title available?)
- scientific article; zbMATH DE number 3186871 (Why is no real title available?)
- Ideals, Varieties, and Algorithms
- Language equivalence of probabilistic pushdown automata
- Language inclusion for boundedly-ambiguous vector addition systems is decidable
- Logical foundations of cyber-physical systems
- Mappings induced by PGSM-mappings and some recursively unsolvable problems of finite probabilistic automata
- Membership in polynomial ideals over \(\mathcal{Q}\) is exponential space complete
- Multiplicity problems on algebraic series and context-free grammars
- Newton series, coinductively: a comparative study of composition
- Nonprimitive recursive complexity and undecidability for Petri net equivalences
- On cancellation properties of languages which are supports of rational power series
- On computable numbers, with an application to the Entscheidungsproblem.
- On polynomial recursive sequences
- On strongest algebraic program invariants
- On the definition of a family of automata
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- On the exponential generating function of labelled trees
- Polynomial automata: zeroness and applications
- Polynomial Invariants for Affine Programs
- Products, polynomials and differential equations in the stream calculus
- Realisation locale des systèmes non linéaires, algèbres de Lie filtrees transitives et séries generatrices non commutatives
- Relationships between nondeterministic and deterministic tape complexities
- Sur divers produits de séries formelles
- The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
- The diagonal of a D-finite power series is D-finite
- Trajectories of polynomial vector fields and ascending chains of polynomial ideals
- Undecidable equivalences for basic parallel processes
- Une théorie combinatoire des séries formelles
- Weak Second‐Order Arithmetic and Finite Automata
- Weakly-unambiguous Parikh automata and their link to holonomic series
- Weighted one-deterministic-counter automata
This page was built for publication: Weighted basic parallel processes and combinatorial enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859936)
