SOTAVerified

Weakly deterministic transformations are subregular

2019-08-01WS 2019Unverified0· sign in to hype

Andrew Lamont, Charlie O{'}Hara, Caitlin Smith

Unverified — Be the first to reproduce this paper.

Reproduce

Abstract

Whether phonological transformations in general are subregular is an open question. This is the case for most transformations, which have been shown to be subsequential, but it is not known whether weakly deterministic mappings form a proper subset of the regular functions. This paper demonstrates that there are regular functions that are not weakly deterministic, and, because all attested processes are weakly deterministic, supports the subregular hypothesis.

Tasks

Reproductions