Learning Subregular Classes of Languages with Factored Deterministic Automata
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Simple induction of (deterministic) probabilistic finite-state automata for phonotactics by stochastic gradient descent
We introduce a simple and highly general phonotactic learner which induces a probabilistic finite-state automaton from word-form data. We describe the learner and show how to parameterize it to induce unrestricted regula…
Sequential Neural Networks as Automata
This work attempts to explain the types of computation that neural networks can perform by relating them to automata. We first define what it means for a real-time network with bounded precision to accept a language. A m…
Formal Languages and TQFTs with Defects
A construction that assigns a Boolean 1D TQFT with defects to a finite state automaton was recently developed by Gustafson, Im, Kaldawy, Khovanov, and Lihn. We show that the construction is functorial with respect to the…
Unbounded Stress in Subregular Phonology
This paper situates culminative unbounded stress systems within the subregular hierarchy for functions. While Baek (2018) has argued that such systems can be uniformly understood as input tier-based strictly local constr…
From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
We prove that all standard subregular language classes are linearly separable when represented by their deciding predicates. This establishes finite observability and guarantees learnability with simple linear models. Sy…