On the inclusion problem for finitely ambiguous rational trace languages
From MaRDI portal
Cites work
- A holonomic systems approach to special functions identities
- A PARALLEL ALGORITHM FOR THE HADAMARD PRODUCT OF HOLONOMIC FORMAL SERIES
- Algebraic functions over finite fields
- Analytic models and ambiguity of context-free languages
- Characterizations of the decidability of some problems for regular trace languages
- D-finite power series
- HOLONOMIC GENERATING FUNCTIONS AND CONTEXT FREE LANGUAGES
- scientific article; zbMATH DE number 4020497 (Why is no real title available?)
- scientific article; zbMATH DE number 3765179 (Why is no real title available?)
- scientific article; zbMATH DE number 41838 (Why is no real title available?)
- scientific article; zbMATH DE number 3489473 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142306 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- On the decidability of some problems about rational subsets of free partially commutative monoids
- On the definition of a family of automata
- Reversal-Bounded Multicounter Machines and Their Decision Problems
This page was built for publication: On the inclusion problem for finitely ambiguous rational trace languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7446125)