Results 1 to 10 of about 614,117 (293)
Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars. [PDF]
PLoS ONE, 2015 The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses the bottom-up method. The time-complexity of this method is high, and it is difficult to apply.
Yi Wang, XiaoQin Zeng, Han Ding
doaj +2 more sources
Entropy, 2013 Polymers of hydrogen cyanide and their hydrolysis products constitute a plausible, but still poorly understood proposal for early prebiotic chemistry on Earth.
Peter F. Stadler +5 more
doaj +3 more sources
Graph Rewriting Techniques in Engineering Design
Frontiers in Built Environment, 2022 Capturing human knowledge underlying the design and engineering of products has been among the main goals of computational engineering since its very beginning. Over the last decades, various approaches have been proposed to tackle this objective.
Lothar Kolbeck +3 more
doaj +1 more source
Probabilistic regular graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extension of regular graphs obtained by labelling the terminal arcs of the graph ...
Christophe Morvan, Nathalie Bertrand
doaj +1 more source
Compressing graphs by grammars [PDF]
2016 IEEE 32nd International Conference on Data Engineering (ICDE), 2016 We present a new graph compressor that detects repeating substructures and represents them by grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other approaches. For RDF graphs and version graphs it outperforms the best known previous methods.
Maneth, Sebastian, Peternek, Fabian
openaire +2 more sources
A Framework for Rewriting Families of String Diagrams [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We describe a mathematical framework for equational reasoning about infinite families of string diagrams which is amenable to computer automation. The framework is based on context-free families of string diagrams which we represent using context-free ...
Vladimir Zamdzhiev
doaj +1 more source
Learning the Morphological and Syntactic Grammars for Named Entity Recognition
Information, 2022 In some languages, Named Entity Recognition (NER) is severely hindered by complex linguistic structures, such as inflection, that will confuse the data-driven models when perceiving the word’s actual meaning.
Mengtao Sun +4 more
doaj +1 more source
Engineering Grammar-Based Type Checking for Graph Rewriting Languages
IEEE Access, 2022 The ability to handle evolving graph structures is important both for programming languages and modeling languages. Of various languages that adopt graphs as primary data structures, a graph rewriting language LMNtal provides features of both (concurrent)
Naoki Yamamoto, Kazunori Ueda
doaj +1 more source
Speeding up Generalized PSR Parsers by Memoization Techniques [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Predictive shift-reduce (PSR) parsing for hyperedge replacement (HR) grammars is very efficient, but restricted to a subclass of unambiguous HR grammars.
Mark Minas
doaj +1 more source
Progressive Content Generation Based on Cyclic Graph for Generate Dungeon
IJCCS (Indonesian Journal of Computing and Cybernetics Systems), 2023 Dungeon is level in game consisting collection of rooms and doors with obstacles inside. To make good level, takes a lot of time. With Procedural Content Generation (PCG), dungeons can be created automatically.
Muhammad Anshar +2 more
doaj +1 more source