PP-2016-38: Constructing Semantic Automata for Quantifier Iterations

PP-2016-38: McWhirter, Sarah and Szymanik, Jakub (2016) Constructing Semantic Automata for Quantifier Iterations. [Report]

[img]
Preview
Text
Manuscript.pdf

Download (371kB) | Preview

Abstract

We expand on recent work extending the semantic automata model of quantifier verification to iteration. We demonstrate a simple and intuitive method to construct a minimal iteration DFA from two DFA recognizing monadic regular quantifier languages and prove that deterministic CFL are also closed under quantifier iteration. We also touch upon the relation between computational results and linguistic discussion of Frege boundary.

Item Type: Report
Report Nr: PP-2016-38
Series Name: Prepublication (PP) Series
Year: 2016
Additional Information: This is a joint research paper based on the MSc work of the first author under the supervision of the second author.
Uncontrolled Keywords: semantic automata; quantifiers; Frege boundary
Subjects: Cognition
Computation
Language
Logic
Philosophy
Depositing User: Jakub Szymanik
Date Deposited: 28 Nov 2016 15:56
Last Modified: 05 Dec 2016 13:18
URI: https://eprints.illc.uva.nl/id/eprint/1414

Actions (login required)

View Item View Item