Refine
Year of publication
- 2011 (3) (remove)
Document Type
- Article (1)
- Conference Proceeding (1)
- Doctoral Thesis (1)
Has Fulltext
- yes (3)
Is part of the Bibliography
- no (3)
Keywords
- Sprachtheorie (3) (remove)
Institute
- Extern (1)
- Informatik (1)
Es ist eine alte Debatte. Auf der einen Seite steht die althergebrachte Maxime, alles, was wert ist, gesagt zu werden, müsse in jeder Sprache gesagt werden können - umso mehr dann, wenn es sich um die Wissenschaft handelt, die den Anspruch erhebt, universelle Wahrheiten zu erfassen. Demgegenüber steht ein immer wieder anzutreffender Gedanke, dessen wohl inspirierteste Formulierung von Wilhelm von Humboldt stammt, nämlich, dass die Verschiedenheit der Sprachen nicht nur eine von „Schällen und Zeichen“, sondern eine der „Weltansichten selbst“ sei. Thema dieses Vortrags ist die Frage, wo die Wahrheit zwischen diesen scheinbaren Gegensätzen liegt.
U radu se razmatraju svi dosada poznati rukopisni primjerci / varijante rječnika zadarskoga kanonika Ivana Tanzlinghera Zanottija, uz ponovno čitanje svih znanstvenih članaka i studija o njima i vraćanje na riječi iz njegove oporuke. Opisuje se i rad na digitalizaciji i mrežnom objavljivanju jednoga od njih. Predstavlja se još jedan rukopisni primjerak njegova rječnika koji je 2009. godine otkriven u Zadru.
A pattern is a word that consists of variables and terminal symbols. The pattern language that is generated by a pattern A is the set of all terminal words that can be obtained from A by uniform replacement of variables with terminal words. For example, the pattern A = a x y a x (where x and y are variables, and the letter a is a terminal symbol) generates the set of all words that have some word a x both as prefix and suffix (where these two occurrences of a x do not overlap). Due to their simple definition, pattern languages have various connections to a wide range of other areas in theoretical computer science and mathematics. Among these areas are combinatorics on words, logic, and the theory of free semigroups. On the other hand, many of the canonical questions in formal language theory are surprisingly difficult. The present thesis discusses various aspects of the inclusion problem of pattern languages. It can be divide in two parts. The first one examines the decidability of pattern languages with a limited number of variables and fixed terminal alphabets. In addition to this, the minimizability of regular expressions with repetition operators is studied. The second part deals with descriptive patterns, the smallest generalizations of arbitrary languages through pattern languages ("smallest" with respect to the inclusion relation). Main questions are the existence and the discoverability of descriptive patterns for arbitrary languages.