Rational sets in commutative monoids
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- Deterministic and unambiguous two-dimensional languages over one-letter alphabet
- The Parikh counting functions of sparse context-free languages are quasi-polynomials
- Inverse morphic equivalence on languages
- Extending regular expressions with iterated shuffle
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
- Complete semi-Thue systems for abelian groups
- On regular trace languages
- On commutative Kleene monoids
- Logically defined subsets of \(\mathbb{N}{}^ k\)
- On a kind of Fatou property of context-free groups
- Learning semilinear sets from examples and via queries
- Group presentations, formal languages and characterizations of one- counter groups
- Two iteration theorems for some families of languages
- On semigroups with maximal conditions
- Counting productions in context-free derivations
- On the size of independent systems of equations in semigroups
- Slightly commutative Kleene semigroups
- Criteria to disprove context freeness of collage languages.
- Modelization of deterministic rational relations
- On a valuation of rational subsets of \(Z^{k}\)
- Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups.
- The synthesis of Petri nets from path-automatic specifications
- Presentations for subsemigroups of finitely generated commutative semigroups
- Petri net languages and infinite subsets of \(\mathbb{N}^m\)
- On problems related to growth, entropy, and spectrum in group theory
- Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
- Two problems for solvable and nilpotent groups
- On the word problem for special monoids
- On bounded linear codes and the commutative equivalence
- On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
- Undecidability of the word problem for one-relator inverse monoids via right-angled Artin subgroups of one-relator groups
- Characterization and complexity results on jumping finite automata
- On rationality of verbal subsets in a group
- Word-mappings of level 2
- Recursive Petri nets
- Decidability of performance equivalence for basic parallel processes
- Deux applications de la représentation matricielle d'une série rationnelle non commutative. (Two applications of matrix representations of a rational non -commutative series)
- Les 1-convexes du monoide commutatif N^n
- Sur la rationalite de certaines séries generatrices
- On positive commutative tomonoids
- A note on some languages in uniform \(ACC^ 0\)
- Existence of home states in Petri nets is decidable
- Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two
- EDT0L solutions to equations in group extensions
- Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
- Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
- Sur quelques classes d’applications de N² dans les ensembles finis
- scientific article; zbMATH DE number 3861446 (Why is no real title available?)
- scientific article; zbMATH DE number 3866597 (Why is no real title available?)
- Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
- Decision problems among the main subfamilies of rational relations
- Deciding whether a relation defined in Presburger logic can be defined in weaker logics
- On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
- On Model Checking Boolean BI
- Decision procedure of some relevant logics: a constructive perspective
- Sur les ensembles linéaires
- scientific article; zbMATH DE number 3527610 (Why is no real title available?)
- scientific article; zbMATH DE number 3551930 (Why is no real title available?)
- scientific article; zbMATH DE number 3553774 (Why is no real title available?)
- A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative
- A NOTE ON LIST LANGUAGES
- Complementation of Branching Automata for Scattered and Countable N-Free Posets
- On the commutative equivalence of bounded context-free and regular languages: the code case
- On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\)
- A representation of finite, positive, commutative tomonoids
- Reachability in Petri nets with inhibitor arcs
- General solution of systems of linear diophantine equations and inequations
- On polynomial ideals, their complexity, and applications
- Petri nets, commutative context-free grammars, and basic parallel processes
- The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
- Rational and Recognisable Power Series
- On the size of independent systems of equations in semigroups
- An Hadamard operation on rational relations
- Verification of population protocols
- Rational subsets of unitriangular groups.
- Holonomic functions and their relation to linearly constrained languages
- Rational semimodules over the max-plus semiring and geometric approach to discrete event systems.
- Nondeterministic tree width of regular languages
- On a Theorem of Malcev
- Une hiérarchie des parties rationnelles de N2
- A proof of Parikh's theorem via Dickson's lemma
- On the Petri net realization of context-free graphs
- Finitely generated left commutative semigroups are residually finite
- A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
- Submonoids and rational subsets of groups with infinitely many ends.
- D-finite multivariate series with arithmetic restrictions on their coefficients
- Undecidability of the submonoid membership problem for free nilpotent group of class l\geqslant 2 of sufficiently large rank
- INTERLEAVING LOGIC AND COUNTING
- Tilings and submonoids of metabelian groups.
- Unique decipherability in the monoid of languages: an application of rational relations
- Rational cross-sections, bounded generation, and orders on groups
- Geometric decision procedures and the VC dimension of linear arithmetic theories
- Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices
- On groups whose cogrowth series is the diagonal of a rational series
- Undecidability of bisimilarity for Petri nets and some related problems
- \(\mathbb{N}\)-rationality of zeta functions
- mathlib4 Module Mathlib/Algebra/Group/Ideal
- mathlib4 Module Mathlib/Algebra/Order/Group/Ideal
- mathlib4 Module Mathlib/ModelTheory/Arithmetic/Presburger/Semilinear/Basic
This page was built for publication: Rational sets in commutative monoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2542523)
