Shuffle Decomposition of Regular Languages
| dc.creator | Ito,Masami | |
| dc.date | 2002 | |
| dc.date.accessioned | 2024-02-06T12:51:39Z | |
| dc.date.available | 2024-02-06T12:51:39Z | |
| dc.description | Let A X* be a regular language. In the paper, we will provide an algorithm to decide whether there exist a nontrivial language B (n, X) and a nontrivial regular language C X* such that A = B C 1.) C. S. Calude, K. Salomaa, S. Yu (eds.). Advances and Trends in Automata and Formal Languages. A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-008-02-0257 | |
| dc.identifier | https://lib.jucs.org/article/27856/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/8108 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 8(2): 257-259 | |
| dc.subject | regular language | |
| dc.subject | shuffle product | |
| dc.subject | shuffle decomposition | |
| dc.subject | (nX) | |
| dc.title | Shuffle Decomposition of Regular Languages | |
| dc.type | Research Article |