The base problem for DOL Parikh sets




Honkala J

PublisherWORLD SCIENTIFIC PUBL CO PTE LTD

2006

International Journal of Foundations of Computer Science

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE

INT J FOUND COMPUT S

17

2

465

473

9

0129-0541

DOIhttps://doi.org/10.1142/S0129054106003929



We give a method to decide whether or not a given DOL Parikh set can be recognized in some base. In the positive case the bases can be computed effectively.



Last updated on 2024-26-11 at 11:07