On hotz groups and homomorphic images of sentential form languages

Author(s):  
Volker Diekert
Keyword(s):  
2011 ◽  
Vol 22 (02) ◽  
pp. 411-426 ◽  
Author(s):  
GEORG ZETZSCHE

This article presents approaches to the open problem of whether erasing rules can be eliminated in matrix grammars. The class of languages generated by non-erasing matrix grammars is characterized by the newly introduced linear Petri net grammars. Petri net grammars are known to be equivalent to arbitrary matrix grammars (without appearance checking). In linear Petri net grammars, the marking has to be linear in size with respect to the length of the sentential form. The characterization by linear Petri net grammars is then used to show that applying linear erasing to a Petri net language yields a language generated by a non-erasing matrix grammar. It is also shown that in Petri net grammars (with final markings and arbitrary labeling), erasing rules can be eliminated, which yields two reformulations of the problem of whether erasing rules in matrix grammars can be eliminated.


Author(s):  
David Schlangen ◽  
Alex Lascarides

We present an approach to the interpretation of non-sentential utterances like B's utterance in the following mini-dialogue: A: ˋˋWho came to the party?'' B: ˋˋPeter.´´ Such utterances pose several puzzles: they convey ˋsentence-type' messages (propositions, questions or request) while being of non-sentential form; and they are constrained both semantically and syntactically by the context. We address these puzzles in our approach which is compositional, since we provide a formal semantics for such fragments independent of their context, and constraint-based because resolution is based on collecting contextual constraints.


2019 ◽  
Vol 5 (1) ◽  
pp. 261-287
Author(s):  
M.Teresa Espinal ◽  
Susagna Tubau

This article critically reviews the main research issues raised in the study of response systems in natural languages by addressing the syntax and semantics of fragment answers and yes/no response particles. Fragment answers include replies that do not have a sentential form, whereas response particles consist solely of an affirmative or a negative adverb. While the main research question in the syntax of fragments and response particles has been whether these contain more syntactic structure than what is actually pronounced, the key issues in the study of their semantics are question–answer congruence, the anaphoric potential of response particles, and the meaning of fragments in relation to positive and negative questions. In connection to these issues, this review suggests some interesting avenues for further research: ( a) providing an analysis of particles other than yes/no, ( b) choosing between echoic versus nonechoic forms as answers to polar questions, and ( c) deciding whether some non-lexically-based or nonverbal responses are systematically used in combination with polar particles to express (dis)agreement.


2010 ◽  
Vol 21 (04) ◽  
pp. 549-569 ◽  
Author(s):  
ERZSÉBET CSUHAJ-VARJÚ ◽  
JÜRGEN DASSOW ◽  
GYÖRGY VASZIL

In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.


Author(s):  
Maarja-Liisa Pilvik

This article describes the typical properties and functions of Estonian -mine action nominals, using dialect corpus data. The dialect data entails non-standard spoken language with a regional dimension and therefore has the potential to display more variation in terms of the behaviour of action nominals in actual language use. This will be demonstrated, inter alia, by the non-canonical realization of arguments, e.g. retaining the sentential form of the patient argument, in phrases headed by -mine action nominals. The article also discusses the problems of assigning a word class to the regularly derived and productive type of action nominals, when taking into account all the possible contexts and constructions in which they can occur.Kokkuvõte. Maarja-Liisa Pilvik: Deverbaalsed mine-teonimed eesti murrete korpuses. Artiklis kirjeldatakse eesti keele mine-teonimede tüüpilisi omadusi ja funktsioone, kasutades eesti murrete korpuse andmeid. Murdekorpus sisaldab mittestandardset kõneldud keelt, millel on ka geograafiline dimensioon, ning seetõttu on korpuse andmetel potentsiaal näidata mine-teonimede käitumises tegelikus keelekasutuses laiemat varieerumist. Seda ilmestab muuhulgas verbi argumentide mittekanooniline realiseerumine, nt patsienti väljendav lauseliige võib säilitada oma lauselise vormi nimisõnafraasides, mille peasõnaks mine-teonimi on. Artiklis puudutatakse ka probleeme, mis seonduvad regulaarselt tuletatavatele mine-teonimedele sõnaklassi määramisega, kui võtta arvesse kontekste ja konstruktsioone, milles mine-teonimed võivad esineda.Võtmesõnad: murdesüntaks; teonimed; nominalisatsioon; konstruktsioonid; eesti keel


2019 ◽  
Vol 30 (01) ◽  
pp. 73-92
Author(s):  
Zsolt Gazdag ◽  
Krisztián Tichler ◽  
Erzsébet Csuhaj-Varjú

Permitting semi-conditional grammars (pSCGs) are extensions of context-free grammars where each rule is associated with a word [Formula: see text] and such a rule can be applied to a sentential form [Formula: see text] only if [Formula: see text] is a subword of [Formula: see text]. We consider permitting generalized SCGs (pgSCGs) where each rule [Formula: see text] is associated with a set of words [Formula: see text] and [Formula: see text] is applicable only if every word in [Formula: see text] occurs in [Formula: see text]. We investigate the generative power of pgSCGs with no erasing rules and prove a pumping lemma for their languages. Using this lemma we show that pgSCGs are strictly weaker than context-sensitive grammars. This solves a long-lasting open problem concerning the generative power of pSCGs. Moreover, we give a comparison of the generating power of pgSCGs and that of forbidding random context grammars with no erasing rules.


Sign in / Sign up

Export Citation Format

Share Document