Factorization in formal languages
We consider several language-theoretic aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an quadratic upper and lower bound on the length of the...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Default Conference proceeding |
| Published: |
2015
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/18859 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|