Project without external funding

Eigentliche Sprachen von Restart Automaten


Project Details
Project duration: 01/200712/2012


Abstract
Motivated by the way in which sentences of natural languages are analyzed in linguistics, we study automata that work on extended alphabets that in addition to the input symbols also contain certain auxiliary symbols. These auxiliary symbols model the use of (morphological, syntactical, and semantical) categories in the process of analyzing sentences. The automata we consider work on so-called characteristic languages, that is, on languages that include auxiliary symbols. The proper language is obtained from a characterisitc language by removing all occurrences of auxiliary symbols. By requiring that the automata are lexicalized, we restrict the lengths of blocks of auxiliary symbols that are admitted. We investigate classes of proper languages for various restricted types of deterministic restarting automata that are lexicalized.


Principal Investigator


Publications
Go to first page Go to previous page 1 of 2 Go to next page Go to last page

2011
2011
2010
2010
2009
2009
2009
2009
2009
2008

Last updated on 2017-11-07 at 14:13