A new class of algebraic series having a decidable equivalence problem

Authors:
Juha Honkala
Affiliations:
Department of Mathematics, University of Turku, FIN-20014 Turku, Finland
Venue:
Fundamenta Informaticae
Year:
2002

Citing 6
Cited 0

Semirings, automata, languages

Semirings, automata, languages
Rational series and their languages

Rational series and their languages
Automata, Languages, and Machines

Automata, Languages, and Machines
Automata: Theoretic Aspects of Formal Power Series

Automata: Theoretic Aspects of Formal Power Series
Decision Problems Concerning Algebraic Series with Noncommuting Variables

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
On the Multiplicity Equivalence Problem for Context-free Grammars

Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a new class of algebraic series with noncommuting variables having a decidable equivalence problem. As a tool we consider star roots of formal power series.