Pages that link to "Item:Q2542523"
From MaRDI portal
The following pages link to Rational sets in commutative monoids (Q2542523):
Displaying 50 items.
- Existence of home states in Petri nets is decidable (Q264201) (← links)
- On the commutative equivalence of bounded context-free and regular languages: the code case (Q476875) (← links)
- On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\) (Q476895) (← links)
- An Hadamard operation on rational relations (Q517036) (← links)
- Verification of population protocols (Q523133) (← links)
- Finitely generated left commutative semigroups are residually finite (Q594202) (← links)
- Submonoids and rational subsets of groups with infinitely many ends. (Q606649) (← links)
- Tilings and submonoids of metabelian groups. (Q633769) (← links)
- Unique decipherability in the monoid of languages: an application of rational relations (Q639857) (← links)
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- \(\mathbb{N}\)-rationality of zeta functions (Q679031) (← links)
- Rational relations having a rational trace on each finite intersection of rational relations (Q714813) (← links)
- The set of realizations of a max-plus linear sequence is semi-polyhedral (Q716317) (← links)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- Non-commutative Gröbner bases in algebras of solvable type (Q752147) (← links)
- Quasi-polynomials, linear Diophantine equations and semi-linear sets (Q764313) (← links)
- The residue of vector sets with applications to decidability problems in Petri nets (Q797285) (← links)
- Properties of congruences on commutative monoids (Q799821) (← links)
- Residual finiteness in permutation varieties of semigroups (Q801042) (← links)
- Complexity of the word problem for commutative semigroups of fixed dimension (Q802020) (← links)
- Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable (Q845664) (← links)
- On the rational subset problem for groups. (Q875109) (← links)
- Closure properties and complexity of rational sets of regular languages (Q888431) (← links)
- A polynomial algorithm for solving systems of two linear diophantine equations (Q914391) (← links)
- The submonoid and rational subset membership problems for graph groups. (Q947493) (← links)
- On bounded rational trace languages (Q970110) (← links)
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet (Q1013124) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
- Inverse morphic equivalence on languages (Q1061490) (← links)
- Extending regular expressions with iterated shuffle (Q1063422) (← links)
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (Q1070831) (← links)
- Complete semi-Thue systems for abelian groups (Q1087012) (← links)
- On regular trace languages (Q1097040) (← links)
- On commutative Kleene monoids (Q1176620) (← links)
- Logically defined subsets of \(\mathbb{N}{}^ k\) (Q1186601) (← links)
- On a kind of Fatou property of context-free groups (Q1186612) (← links)
- Learning semilinear sets from examples and via queries (Q1200804) (← links)
- Group presentations, formal languages and characterizations of one- counter groups (Q1210289) (← links)
- Two iteration theorems for some families of languages (Q1214758) (← links)
- On semigroups with maximal conditions (Q1231013) (← links)
- Counting productions in context-free derivations (Q1249944) (← links)
- On the size of independent systems of equations in semigroups (Q1351001) (← links)
- Slightly commutative Kleene semigroups (Q1359026) (← links)
- Criteria to disprove context freeness of collage languages. (Q1401171) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- On a valuation of rational subsets of \(Z^{k}\) (Q1853733) (← links)
- Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups. (Q1854344) (← links)
- The synthesis of Petri nets from path-automatic specifications (Q1882929) (← links)
- Presentations for subsemigroups of finitely generated commutative semigroups (Q1961347) (← links)
- Petri net languages and infinite subsets of \(\mathbb{N}^m\) (Q1970198) (← links)
