On equality of multiplicity sets of regular languages
From MaRDI portal
Recommendations
- The equivalence problem of multitape finite automata
- On the regularity of sets of multi-accepted strings of a non-deterministic finite automaton
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
- scientific article; zbMATH DE number 1948505
- Cardinality problems of compositions of morphisms and inverse morphisms
Cites work
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3588051 (Why is no real title available?)
- Bounded Regular Sets
- Direct proofs of the undecidability of the equivalence problem for sentential forms of linear context-free grammars and the equivalence problem for OL systems
- On sentential forms of context-free grammars
- Remarks on commutative N-rational series
- The unsolvability of the equality problem for sentential forms of context-free grammars
Cited in
(12)- A note on the equivalence problem of rational formal power series
- scientific article; zbMATH DE number 3874640 (Why is no real title available?)
- On the Images of ℕ-Rational Sequences Counting Multiplicities
- On the regularity of sets of multi-accepted strings of a non-deterministic finite automaton
- scientific article; zbMATH DE number 5593274 (Why is no real title available?)
- A structural property of regular frequency computations.
- Multiplicities: A deterministic view of nondeterminism
- Defining families of trees with E0L grammars
- On images of D0L and DT0L power series.
- Duality and Equational Theory of Regular Languages
- Herzog–Schönheim conjecture, vanishing sums of roots of Unity and convex polygons
- Quasi-universal \(k\)-regular sequences
This page was built for publication: On equality of multiplicity sets of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087336)
