Decision problems concerning algebraic series with noncommuting variables




Honkala J

PublisherSPRINGER-VERLAG BERLIN

1997

Lecture Notes in Computer Science

STRUCTURES IN LOGIC AND COMPUTER SCIENCE

LECT NOTES COMPUT SC

1261

281

290

10

0302-9743



Equivalence and rationality problems are shown to be decidable for algebraic series with noncommuting variables having bounded supports. As a tool, Parikh simplifying mappings are defined and studied.



Last updated on 2024-26-11 at 22:42