Pages that link to "Item:Q2523032"
From MaRDI portal
The following pages link to Semigroups, Presburger formulas, and languages (Q2523032):
Displaying 50 items.
- Existence of home states in Petri nets is decidable (Q264201) (← links)
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- Regular languages and partial commutations (Q391641) (← links)
- The computational power of simple protocols for self-awareness on graphs (Q392008) (← links)
- Computational models for networks of tiny artifacts: a survey (Q465666) (← 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)
- Multipass automata and group word problems (Q495997) (← links)
- Automata for unordered trees (Q515668) (← links)
- Verification of population protocols (Q523133) (← links)
- Mediated population protocols (Q533894) (← links)
- Automata and processes on multisets of communicating objects (Q609033) (← links)
- Unique decipherability in the monoid of languages: an application of rational relations (Q639857) (← links)
- Passively mobile communicating machines that use restricted space (Q650876) (← links)
- Undecidability of bisimilarity for Petri nets and some related problems (Q672326) (← links)
- The algebraic theory of Parikh automata (Q722218) (← links)
- Quasi-polynomials, linear Diophantine equations and semi-linear sets (Q764313) (← links)
- Bounded languages described by GF(2)-grammars (Q832949) (← links)
- Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable (Q845664) (← links)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- The Parikh counting functions of sparse context-free languages are quasi-polynomials (Q1034637) (← links)
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable (Q1044697) (← links)
- Normal Petri nets (Q1057065) (← links)
- The decidability of persistence for vector addition systems (Q1144929) (← links)
- The complexity of the equivalence problem for two characterizations of Presburger sets (Q1149429) (← links)
- Persistence of vector replacement systems is decidable (Q1149775) (← links)
- Logically defined subsets of \(\mathbb{N}{}^ k\) (Q1186601) (← links)
- Formulas, regular languages and Boolean circuits (Q1193413) (← links)
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
- Two iteration theorems for some families of languages (Q1214758) (← links)
- Decidable problems on the strong connectivity of Petri net reachability sets (Q1240066) (← links)
- Langages algébriques, paires iterantes et transductions rationnelles (Q1247022) (← links)
- Counting productions in context-free derivations (Q1249944) (← links)
- Presburgerness of predicates regular in two number systems (Q1259594) (← links)
- Automaticity of double sequences generated by one-dimensional linear cellular automata (Q1389657) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- Distances between languages and reflexivity of relations (Q1608895) (← links)
- Document spanners: from expressive power to decision problems (Q1650917) (← links)
- Minimizing cost travel in multimodal transport using advanced relation transitive closure (Q1738983) (← links)
- On two-way nondeterministic finite automata with one reversal-bounded counter (Q1763701) (← links)
- Multitree automata that count (Q1770418) (← links)
- The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) (← links)
- Decidability of bisimilarity for one-counter processes. (Q1854338) (← links)
- The star problem and the finite power property in trace monoids: Reductions beyond C4 (Q1854540) (← links)
- The synthesis of Petri nets from path-automatic specifications (Q1882929) (← links)
- Two techniques in the area of the star problem in trace monoids (Q1884907) (← links)
- On two-way FA with monotonic counters and quadratic Diophantine equations (Q1884954) (← links)
- Leaderless deterministic chemical reaction networks (Q2003464) (← links)
- Towards efficient verification of population protocols (Q2058386) (← links)
- What's decidable about weighted automata? (Q2064522) (← links)