On equality of multiplicity sets of regular languages

DOI10.1016/0304-3975(85)90035-0zbMath0611.68049OpenAlexW2034943852MaRDI QIDQ1087336

Keijo Ruohonen

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90035-0

zbMATH Keywords

nondeterministic finite automatonequivalence problem for multiplicity sets of regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

A note on the equivalence problem of rational formal power series ⋮ On images of D0L and DT0L power series. ⋮ Defining families of trees with E0L grammars ⋮ Quasi-universal \(k\)-regular sequences ⋮ On the Images of ℕ-Rational Sequences Counting Multiplicities

Cites Work

• Unnamed Item
• Unnamed Item
• Remarks on commutative N-rational series
• The unsolvability of the equality problem for sentential forms of context-free grammars
• 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
• Bounded Regular Sets