Zobrazeno 1 - 10
of 144
pro vyhledávání: '"Truthe, Bianca"'
Autor:
Ködding, Marvin, Truthe, Bianca
Publikováno v:
EPTCS 407, 2024, pp. 118-135
In this paper, we continue the research on the power of contextual grammars with selection languages from subfamilies of the family of regular languages. We investigate various comet-like types of languages and compare such language families to some
Externí odkaz:
http://arxiv.org/abs/2409.06974
Autor:
Truthe, Bianca
Publikováno v:
EPTCS 388, 2023, pp. 125-139
In this paper, we continue the research on the power of contextual grammars with selection languages from subfamilies of the family of regular languages. In the past, two independent hierarchies have been obtained for external and internal contextual
Externí odkaz:
http://arxiv.org/abs/2309.08724
Autor:
Truthe, Bianca
Publikováno v:
EPTCS 386, 2023, pp. 253-268
Tree-controlled grammars are context-free grammars where the derivation process is controlled in such a way that every word on a level of the derivation tree must belong to a certain control language. We investigate the generative capacity of such tr
Externí odkaz:
http://arxiv.org/abs/2309.02768
Autor:
Dassow, Jürgen1 dassow@iws.cs.uni-magdeburg.de, Truthe, Bianca2 bianca.truthe@informatik.uni-giessen.de
Publikováno v:
Computer Science Journal of Moldova. 2024, Vol. 32 Issue 3, p372-388. 17p.
On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages
Autor:
Dassow, Jürgen, Truthe, Bianca
Publikováno v:
EPTCS 367, 2022, pp. 65-80
We continue the research on the generative capacity of contextual grammars where contexts are adjoined around whole words (externally) or around subwords (internally) which belong to special regular selection languages. All languages generated by con
Externí odkaz:
http://arxiv.org/abs/2208.14725
Autor:
Truthe, Bianca
Publikováno v:
EPTCS 31, 2010, pp. 177-188
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their deterministic and tabled variants with respect to the number of rules and the number of symbols. We determine the decrease of complexity when the generat
Externí odkaz:
http://arxiv.org/abs/1008.1660
Publikováno v:
EPTCS 3, 2009
The 11th workshop, Descriptional Complexity of Formal Systems 2009, is taking place in Magdeburg, Germany, on July 6-9, 2009. It is jointly organized by the IFIP Working Group 1.2 on Descriptional Complexity and by the Faculty of Computer Science at
Externí odkaz:
http://arxiv.org/abs/0907.5257
Autor:
Truthe, Bianca1 (AUTHOR) bianca.truthe@informatik.uni-giessen.de, Hirvensalo, Mika (AUTHOR), Mráz, František (AUTHOR), Průša, Daniel (AUTHOR)
Publikováno v:
Fundamenta Informaticae. 2021, Vol. 180 Issue 1/2, p123-150. 28p.
Publikováno v:
In Theoretical Computer Science 31 August 2012 449:64-73
Autor:
Manea, Florin, Truthe, Bianca
Journal of Automata, Languages and Combinatorics, Volume 27, Numbers 1-3, 2022, 3-13
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1fc06effffa517ec183bcf4118b0448e