Pub Date : 2020-05-21DOI: 10.17345/triangle11.ix-x
M. J. Rodríguez Campillo
Este volumen está formado por seis artículos. El primero de ellos es el de la propia autora, la Dra. Marina Mayoral, que nos agasaja explicándonos cómo ha concebido "La construcción de Deseos". A este primer artículo, interesantísimo, le sigue un trabajo de M. José Rodríguez Campillo en el que se analiza "El título Deseos en la obra de Marina Mayoral". A continuación, Anna Corts Curto se ocupa del análisis del "Universo íntimo de Marina Mayoral: Brétema". El cuarto artículo, de Christian Snoey, presenta un minucioso estudio sobre "Tiempo y tiempos en Deseos". "La Figura de Constanza en Deseos" es analizada por María Anguera y Marina Silva. Cierra el volumen una "Breve aproximación a la figura de Lilith en Deseos", a cargo de Abel Moreno.
这本书由六篇文章组成。第一个是作者自己的，玛丽娜·马约尔博士，她向我们解释了她是如何构想“欲望的构建”的，这让我们很高兴。在第一篇非常有趣的文章之后，M. jose rodriguez Campillo分析了“Marina Mayoral作品中的标题欲望”。接下来，Anna Corts Curto分析了“Marina Mayoral的亲密宇宙:bretema”。第四篇文章由克里斯蒂安·斯诺尼(Christian Snoey)撰写，对“欲望中的时间和时间”进行了详细的研究。maria安圭拉和玛丽娜·席尔瓦分析了“欲望中的康斯坦扎形象”。这本书的结尾是阿贝尔·莫雷诺(Abel Moreno)的《欲望中的莉莉丝》(Lilith in wanted)。
{"title":"Prefacio","authors":"M. J. Rodríguez Campillo","doi":"10.17345/triangle11.ix-x","DOIUrl":"https://doi.org/10.17345/triangle11.ix-x","url":null,"abstract":"Este volumen está formado por seis artículos. El primero de ellos es el de la propia autora, la Dra. Marina Mayoral, que nos agasaja explicándonos cómo ha concebido \"La construcción de Deseos\". A este primer artículo, interesantísimo, le sigue un trabajo de M. José Rodríguez Campillo en el que se analiza \"El título Deseos en la obra de Marina Mayoral\". A continuación, Anna Corts Curto se ocupa del análisis del \"Universo íntimo de Marina Mayoral: Brétema\". El cuarto artículo, de Christian Snoey, presenta un minucioso estudio sobre \"Tiempo y tiempos en Deseos\". \"La Figura de Constanza en Deseos\" es analizada por María Anguera y Marina Silva. Cierra el volumen una \"Breve aproximación a la figura de Lilith en Deseos\", a cargo de Abel Moreno.","PeriodicalId":76763,"journal":{"name":"Triangle; the Sandoz journal of medical science","volume":"10 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88841676","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-05-21DOI: 10.17345/triangle11.15-32
Anna Corts Curto
Painting scenarios where to place characters with their stories is one of the most complex tasks in characterizing the space of a literary work. Most authors change space each time they start a new novel. In the case of Marina Mayoral, we found a room of her own, a closed universe that has its well-defined contours. In Mayoral, the central space of each work is directly related to a term: Brétema. In this paper, we will try to draw contours in an amazing world that takes its name in La única libertad (Mayoral 1982) and that links all her works.
在描绘文学作品空间的过程中，最复杂的任务之一是描绘人物和故事的场景。大多数作家每次开始写新小说时都会改变空间。在玛丽娜·马约拉尔的案例中，我们找到了她自己的房间，一个有着明确轮廓的封闭宇宙。在马约拉尔，每件作品的中心空间都与一个术语直接相关:br忧郁。在本文中，我们将尝试在一个以La única libertad (Mayoral 1982)命名的神奇世界中绘制轮廓，并将她的所有作品联系起来。
{"title":"El universo íntimo de Marina Mayoral: Brétema","authors":"Anna Corts Curto","doi":"10.17345/triangle11.15-32","DOIUrl":"https://doi.org/10.17345/triangle11.15-32","url":null,"abstract":"Painting scenarios where to place characters with their stories is one of the most complex tasks in characterizing the space of a literary work. Most authors change space each time they start a new novel. In the case of Marina Mayoral, we found a room of her own, a closed universe that has its well-defined contours. In Mayoral, the central space of each work is directly related to a term: Brétema. In this paper, we will try to draw contours in an amazing world that takes its name in La única libertad (Mayoral 1982) and that links all her works.","PeriodicalId":76763,"journal":{"name":"Triangle; the Sandoz journal of medical science","volume":"7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79725475","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-05-21DOI: 10.17345/triangle11.33-49
Christian Snoey Abadías
Time has always been a field full of experimental innovations during the 20th century, and Deseos, by Marina Mayoral, is not alien to that. This novel contains a double analysis of time: On one hand from a philosophical point of view, fiction gets divided on many occasions in two dierent parts: the chronological time of the clock and the psychological or lived time, which ts with the personal experience of time. On the other hand, from a technical perspective, the way time builds the structure of the text will be studied, and also the different kinds of flashbacks that allow characters' soliloquies. Finally, implicit and explicit time indicators that guide time's becoming will also be object of study.
{"title":"Tiempo y tiempos en \"Deseos\"","authors":"Christian Snoey Abadías","doi":"10.17345/triangle11.33-49","DOIUrl":"https://doi.org/10.17345/triangle11.33-49","url":null,"abstract":"Time has always been a field full of experimental innovations during the 20th century, and Deseos, by Marina Mayoral, is not alien to that. This novel contains a double analysis of time: On one hand from a philosophical point of view, fiction gets divided on many occasions in two dierent parts: the chronological time of the clock and the psychological or lived time, which ts with the personal experience of time. On the other hand, from a technical perspective, the way time builds the structure of the text will be studied, and also the different kinds of flashbacks that allow characters' soliloquies. Finally, implicit and explicit time indicators that guide time's becoming will also be object of study.","PeriodicalId":76763,"journal":{"name":"Triangle; the Sandoz journal of medical science","volume":"19 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78997866","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-29DOI: 10.17345/triangle8.137-152
S. Turaev
This paper shows that Petri net control mechanisms in grammars can be considered to be a unifying approach to dierent controls and characterizations which are used in well-known families of languages such as matrix and vector languages.
{"title":"Towards a Unified Theory of Regulated Grammars","authors":"S. Turaev","doi":"10.17345/triangle8.137-152","DOIUrl":"https://doi.org/10.17345/triangle8.137-152","url":null,"abstract":"This paper shows that Petri net control mechanisms in grammars can be considered to be a unifying approach to dierent controls and characterizations which are used in well-known families of languages such as matrix and vector languages.","PeriodicalId":76763,"journal":{"name":"Triangle; the Sandoz journal of medical science","volume":"4966 4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76114395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-29DOI: 10.17345/triangle8.19-41
M. Grando
The aim of this paper is to show how grammar systems and concurrent programs might be viewed as related models for distributed and cooperating computation. We argue that it is possible to translate a grammar system into a concurrent program, where the Owicki-Gries theory and other tools available in the programming framework can be used. The converse translation is also possible and this turns out to be useful when we are looking for a grammar system that can generate a given language. In order to show this we use tools from concurrent programming theory to prove that Lcd = {anbmcndm | n,m ≥ 1} can be generated by a non-returning Parallel Communicating grammar system with three regular components. We show that this strategy can be helpful in the construction of grammar systems that generate strings in less time and more eciently. We also discuss the absence of strategies in the concurrent programming theory to prove that Lcd can be generated by any Parallel Communicating grammar system with two regular components.
{"title":"Owicki-Gries Theory: A Possible Way of Relating Grammar Systems to Concurrent Programs","authors":"M. Grando","doi":"10.17345/triangle8.19-41","DOIUrl":"https://doi.org/10.17345/triangle8.19-41","url":null,"abstract":"The aim of this paper is to show how grammar systems and concurrent programs might be viewed as related models for distributed and cooperating computation. We argue that it is possible to translate a grammar system into a concurrent program, where the Owicki-Gries theory and other tools available in the programming framework can be used. The converse translation is also possible and this turns out to be useful when we are looking for a grammar system that can generate a given language. In order to show this we use tools from concurrent programming theory to prove that Lcd = {anbmcndm | n,m ≥ 1} can be generated by a non-returning Parallel Communicating grammar system with three regular components. We show that this strategy can be helpful in the construction of grammar systems that generate strings in less time and more eciently. We also discuss the absence of strategies in the concurrent programming theory to prove that Lcd can be generated by any Parallel Communicating grammar system with two regular components.","PeriodicalId":76763,"journal":{"name":"Triangle; the Sandoz journal of medical science","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76316692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-29DOI: 10.17345/triangle8.101-120
B. Nagy
In this paper we discuss parallel derivations for context-free, contextsensitive and phrase-structure grammars. For regular and linear grammars only sequential derivation can be applied, but a kind of parallelism is present in linear grammars. We show that nite languages can be generated by a recursion-free rule-set. It is well-known that in context-free grammars the derivation can be in maximal (independent) parallel way. We show that in cases of context-sensitive and recursively enumerable languages the parallel branches of the derivation have some synchronization points. In the case of context-sensitive grammars this synchronization can only be local, but in a derivation of an arbitrary grammar we cannot make this restriction. We present a framework to show how the concept of parallelism can be t to the derivations in formal language theory using tokens.
{"title":"Derivation \"Trees\" and Parallelism in Chomsky-Type Grammars","authors":"B. Nagy","doi":"10.17345/triangle8.101-120","DOIUrl":"https://doi.org/10.17345/triangle8.101-120","url":null,"abstract":"In this paper we discuss parallel derivations for context-free, contextsensitive and phrase-structure grammars. For regular and linear grammars only sequential derivation can be applied, but a kind of parallelism is present in linear grammars. We show that nite languages can be generated by a recursion-free rule-set. It is well-known that in context-free grammars the derivation can be in maximal (independent) parallel way. We show that in cases of context-sensitive and recursively enumerable languages the parallel branches of the derivation have some synchronization points. In the case of context-sensitive grammars this synchronization can only be local, but in a derivation of an arbitrary grammar we cannot make this restriction. We present a framework to show how the concept of parallelism can be t to the derivations in formal language theory using tokens.","PeriodicalId":76763,"journal":{"name":"Triangle; the Sandoz journal of medical science","volume":"39 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86651745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-29DOI: 10.17345/triangle8.55-79
Vicenzo Manca, M. D. Jiménez López
This paper presents an overview of General Natural Syntax (GNS), a formal theory of general explicative power that generalizes and formalizes syntactic concepts in order to oer a general notion of syntax that is independent of any particular language.
{"title":"GNS: Abstract Syntax for Natural Languages","authors":"Vicenzo Manca, M. D. Jiménez López","doi":"10.17345/triangle8.55-79","DOIUrl":"https://doi.org/10.17345/triangle8.55-79","url":null,"abstract":"This paper presents an overview of General Natural Syntax (GNS), a formal theory of general explicative power that generalizes and formalizes syntactic concepts in order to oer a general notion of syntax that is independent of any particular language.","PeriodicalId":76763,"journal":{"name":"Triangle; the Sandoz journal of medical science","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87754033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-29DOI: 10.17345/triangle8.43-54
Guangwu Liu
This paper is a summary of my seminars given in the Research Group on Mathematical Linguistics in the year 2005. It is a short survey on automata theory, including nite state automata and tree automata. The transformations (transductions) induced by nite state automata and tree automata are given.
{"title":"Transformations Induced by Transducers","authors":"Guangwu Liu","doi":"10.17345/triangle8.43-54","DOIUrl":"https://doi.org/10.17345/triangle8.43-54","url":null,"abstract":"This paper is a summary of my seminars given in the Research Group on Mathematical Linguistics in the year 2005. It is a short survey on automata theory, including nite state automata and tree automata. The transformations (transductions) induced by nite state automata and tree automata are given.","PeriodicalId":76763,"journal":{"name":"Triangle; the Sandoz journal of medical science","volume":"81 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82501228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-29DOI: 10.17345/triangle8.121-136
Cristina Tîrnăucă
Identication of deterministic nite automata (DFAs) has an extensive history, both in passive learning and in active learning. Intractability results by Gold [5] and Angluin [1] show that nding the smallest automaton consistent with a set of accepted and rejected strings is NP-complete. Nevertheless, a lot of work has been done on learning DFAs from examples within specic heuristics, starting with Trakhtenbrot and Barzdin's algorithm [15], rediscovered and applied to the discipline of grammatical inference by Gold [5]. Many other algorithms have been developed, the convergence of most of which is based on characteristic sets: RPNI (Regular Positive and Negative Inference) by J. Oncina and P. García [11, 12], Traxbar by K. Lang [8], EDSM (Evidence Driven State Merging), Windowed EDSM and Blue- Fringe EDSM by K. Lang, B. Pearlmutter and R. Price [9], SAGE (Self-Adaptive Greedy Estimate) by H. Juillé [7], etc. This paper provides a comprehensive study of the most important state merging strategies developed so far.
无论是在被动学习还是在主动学习中，确定性自动机(dfa)的识别都有着广泛的历史。Gold[5]和Angluin[1]的顽固性结果表明，找到与一组接受和拒绝的字符串一致的最小自动机是np完全的。尽管如此，从特定启发式中的示例学习dfa方面已经做了大量工作，从Trakhtenbrot和Barzdin的算法[15]开始，Gold[5]重新发现并将其应用于语法推理学科。已经开发了许多其他算法，其中大多数算法的收敛是基于特征集的:J. Oncina和P. García的RPNI(正则正负推理)[11,12]，K. Lang的Traxbar [8]， EDSM(证据驱动状态合并)，K. Lang, B. Pearlmutter和R. Price的Windowed EDSM和Blue- Fringe EDSM [9]， H. juill的SAGE(自适应贪婪估计)[7]等。本文对迄今为止最重要的国家合并策略进行了全面的研究。
{"title":"A Survey of State Merging Strategies for DFA Identification in the Limit","authors":"Cristina Tîrnăucă","doi":"10.17345/triangle8.121-136","DOIUrl":"https://doi.org/10.17345/triangle8.121-136","url":null,"abstract":"Identication of deterministic nite automata (DFAs) has an extensive history, both in passive learning and in active learning. Intractability results by Gold [5] and Angluin [1] show that nding the smallest automaton consistent with a set of accepted and rejected strings is NP-complete. Nevertheless, a lot of work has been done on learning DFAs from examples within specic heuristics, starting with Trakhtenbrot and Barzdin's algorithm [15], rediscovered and applied to the discipline of grammatical inference by Gold [5]. Many other algorithms have been developed, the convergence of most of which is based on characteristic sets: RPNI (Regular Positive and Negative Inference) by J. Oncina and P. García [11, 12], Traxbar by K. Lang [8], EDSM (Evidence Driven State Merging), Windowed EDSM and Blue- Fringe EDSM by K. Lang, B. Pearlmutter and R. Price [9], SAGE (Self-Adaptive Greedy Estimate) by H. Juillé [7], etc. This paper provides a comprehensive study of the most important state merging strategies developed so far.","PeriodicalId":76763,"journal":{"name":"Triangle; the Sandoz journal of medical science","volume":"74 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78734948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-06-29DOI: 10.17345/triangle8.89-99
B. Nagy
Both deterministic and non-deterministic nite state machines (automata) recognize regular languages exactly. Now we extend these machines using two heads to characterize even-linear and linear languages. The heads move in opposite directions in these automata. For even-linear languages, deterministic automata have the same eciency as non-deterministic ones, but for the general case (linear languages) only the non-deterministic version is sucient. We compare our automata to other two-head automata as well.
{"title":"A Class of 2-Head Finite Automata for Linear Languages","authors":"B. Nagy","doi":"10.17345/triangle8.89-99","DOIUrl":"https://doi.org/10.17345/triangle8.89-99","url":null,"abstract":"Both deterministic and non-deterministic nite state machines (automata) recognize regular languages exactly. Now we extend these machines using two heads to characterize even-linear and linear languages. The heads move in opposite directions in these automata. For even-linear languages, deterministic automata have the same eciency as non-deterministic ones, but for the general case (linear languages) only the non-deterministic version is sucient. We compare our automata to other two-head automata as well.","PeriodicalId":76763,"journal":{"name":"Triangle; the Sandoz journal of medical science","volume":"70 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2018-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77331576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：