Complexity of the Uniform Membership Problem for Hyperedge Replacement Grammars
T Pshenitsyn - arXiv preprint arXiv:2501.08082, 2025 - arxiv.org
We investigate complexity of the uniform membership problem for hyperedge replacement
grammars in comparison with other mildly context-sensitive grammar formalisms. It turns out …
grammars in comparison with other mildly context-sensitive grammar formalisms. It turns out …
[HTML][HTML] Multiple context-free tree grammars: Lexicalization and characterization
Multiple (simple) context-free tree grammars are investigated, where “simple” means “linear
and nondeleting”. Every multiple context-free tree grammar that is finitely ambiguous can be …
and nondeleting”. Every multiple context-free tree grammar that is finitely ambiguous can be …
[PDF][PDF] Induction, Training, and Parsing Strategies beyond Context-free Grammars
K Gebhardt - 2020 - core.ac.uk
A distinguishing feature of humankind is the capacity to use symbolic language for
communication and representation of information. Computers, which are meant to process …
communication and representation of information. Computers, which are meant to process …
[PDF][PDF] Theorietage der Gesellschaft für Informatik in Speyer 2015
H Fernau - 2016 - pdfs.semanticscholar.org
Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue Page 1 Meeting
Report Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue Henning …
Report Theorietage der Gesellschaft für Informatik in Speyer 2015—Special Issue Henning …