Dyekiss, Emil Gergely (2012) Finite state automatons in information states. In: Twenty Years of Theoretical Linguistics in Budapest, 2010.11.25-2010.11.27, Budapest.
|
Text
tlp20_dyekiss.pdf Download (258kB) | Preview |
Abstract
The aim of this paper is to introduce a certain kind of information state repre- sentation in a dynamic system of propositional logic, using finite state automatons and highlight its advantages, including relation to inquisitive semantics and belief revision.
| Item Type: | Conference or Workshop Item (Lecture) |
|---|---|
| Additional Information: | In.: Kiefer Ferenc (szerk.), Bánréti Zoltán (szerk.): Twenty Years of Theoretical Linguistics in Budapest. Budapest: MTA Nyelvtudományi Intézet - Tinta Könyvkiadó, 2012. |
| Subjects: | P Language and Literature / nyelvészet és irodalom > P0 Philology. Linguistics / filológia, nyelvészet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 04 Dec 2014 13:38 |
| Last Modified: | 04 Dec 2014 13:38 |
| URI: | http://real.mtak.hu/id/eprint/18855 |
Actions (login required)
 |
Edit Item |
