Rational sets in commutative monoids

Cites work

scientific article; zbMATH DE number 3216273 (Why is no real title available?)
Bounded Algol-Like Languages

Cited in

(only showing first 100 items - show all)

Sur les ensembles linéaires
On problems related to growth, entropy, and spectrum in group theory
Submonoids and rational subsets of groups with infinitely many ends.
Complementation of Branching Automata for Scattered and Countable N-Free Posets
On a Theorem of Malcev
An Hadamard operation on rational relations
mathlib4 Module Mathlib/ModelTheory/Arithmetic/Presburger/Semilinear/Basic
mathlib4 Module Mathlib/ModelTheory/Arithmetic/Presburger/Semilinear/Defs
mathlib4 Module Mathlib/Algebra/Group/Ideal
mathlib4 Module Mathlib/Algebra/Order/Group/Ideal
The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
Tilings and submonoids of metabelian groups.
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
Les 1-convexes du monoide commutatif N$^n$
Sur la rationalite de certaines séries generatrices
Verification of population protocols
Two iteration theorems for some families of languages
On polynomial ideals, their complexity, and applications
On the commutative equivalence of bounded context-free and regular languages: the semi-linear case
On a valuation of rational subsets of $Z^{k}$
On the size of independent systems of equations in semigroups
Deterministic and unambiguous two-dimensional languages over one-letter alphabet
A deterministic algorithm to decide if a finitely presented abelian monoid is cancellative
Existence of home states in Petri nets is decidable
Counting productions in context-free derivations
On the word problem for special monoids
Rational cross-sections, bounded generation, and orders on groups
Criteria to disprove context freeness of collage languages.
Undecidability of bisimilarity for Petri nets and some related problems
On bounded rational trace languages
A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
Complexity of the word problem for commutative semigroups of fixed dimension
Complete semi-Thue systems for abelian groups
Extending regular expressions with iterated shuffle
Learning semilinear sets from examples and via queries
An algorithm to decide whether a rational subset of ${\mathbb{N}}^ k$ is recognizable
Reachability in Petri nets with inhibitor arcs
Logically defined subsets of $\mathbb{N}{}^ k$
Two problems for solvable and nilpotent groups
Separability of rational relations in A^* N^m by recognizable relations is decidable
The synthesis of Petri nets from path-automatic specifications
A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
Rational relations having a rational trace on each finite intersection of rational relations
Une hiérarchie des parties rationnelles de N2
scientific article; zbMATH DE number 3861446 (Why is no real title available?)
On the Petri net realization of context-free graphs
Group presentations, formal languages and characterizations of one- counter groups
Holonomic functions and their relation to linearly constrained languages
scientific article; zbMATH DE number 3551930 (Why is no real title available?)
scientific article; zbMATH DE number 3553774 (Why is no real title available?)
Decidability of performance equivalence for basic parallel processes
Modelization of deterministic rational relations
Optimal algorithms for the coverability, the subword, the containment, and the equivalence problems for commutative semigroups.
Finitely generated left commutative semigroups are residually finite
Local testability from words to traces, a suitable definition
Word-mappings of level 2
On regular trace languages
A proof of Parikh's theorem via Dickson's lemma
On Model Checking Boolean BI
On the size of independent systems of equations in semigroups
A NOTE ON LIST LANGUAGES
Closure properties and complexity of rational sets of regular languages
On the rational subset problem for groups.
Rational and Recognisable Power Series
A note on some languages in uniform $ACC^ 0$
Petri net languages and infinite subsets of $\mathbb{N}^m$
Decision procedure of some relevant logics: a constructive perspective
$\mathbb{N}$-rationality of zeta functions
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)
The set of realizations of a max-plus linear sequence is semi-polyhedral
Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank
A representation of finite, positive, commutative tomonoids
On rationality of verbal subsets in a group
Sur quelques classes d’applications de $N^2$ dans les ensembles finis
On positive commutative tomonoids
Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
A polynomial algorithm for solving systems of two linear diophantine equations
INTERLEAVING LOGIC AND COUNTING
D-finite multivariate series with arithmetic restrictions on their coefficients
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$
On commutative Kleene monoids
Decision problems among the main subfamilies of rational relations
The submonoid and rational subset membership problems for graph groups.
Nondeterministic tree width of regular languages
Unique decipherability in the monoid of languages: an application of rational relations
Quasi-polynomials, linear Diophantine equations and semi-linear sets
Slightly commutative Kleene semigroups
Non-commutative Gröbner bases in algebras of solvable type
Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two
Complementation of Branching Automata for Scattered and Countable Series-Parallel Posets
On a kind of Fatou property of context-free groups
Deciding whether a relation defined in Presburger logic can be defined in weaker logics
scientific article; zbMATH DE number 3866597 (Why is no real title available?)
Characterization and complexity results on jumping finite automata
On the Complexity of Hmelevskii’s Theorem and Satisfiability of Three Unknown Equations
Geometric decision procedures and the VC dimension of linear arithmetic theories
On bounded linear codes and the commutative equivalence
The Parikh counting functions of sparse context-free languages are quasi-polynomials
EDT0L solutions to equations in group extensions

Describes a project that uses

Uses Software

ALGOL 60

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)