Skip to main content

Research Repository

Advanced Search

All Outputs (3)

Unique decipherability in formal languages (2019)
Journal Article
Bell, P. C., Reidenbach, D., & Shallit, J. O. (2020). Unique decipherability in formal languages. Theoretical Computer Science, 804, 149 - 160. https://doi.org/10.1016/j.tcs.2019.11.022

We consider several language-theoretic aspects of various notions of unique decipherability (or unique factorization) in formal languages. Given a language L at some position within the Chomsky hierarchy, we investigate the language of words UD(L) in... Read More about Unique decipherability in formal languages.

Freeness properties of weighted and probabilistic automata over bounded languages (2019)
Journal Article
Bell, P. C., Chen, S., & Jackson, L. (2019). Freeness properties of weighted and probabilistic automata over bounded languages. Information and Computation, 269, -. https://doi.org/10.1016/j.ic.2019.104440

There has been much research into freeness properties of finitely generated matrix semigroups under various constraints, such as the dimensions of the generator matrices and the semiring over which the matrices are defined. Most freeness problems hav... Read More about Freeness properties of weighted and probabilistic automata over bounded languages.