Results 1 to 10 of about 2,196 (168)
Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars. [PDF]
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
Graph Rewriting Techniques in Engineering Design
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]
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
A TESTBED FOR APPLYING OPERATIONALIZED GRAPH GRAMMARS TO SUSTAINABILITY ANALYSIS IN INTEGRATED BIM-GIS SCENARIOS [PDF]
Environmental aspects are becoming increasingly important for construction projects and thus holistic analysis spanning different scopes such as the building and city context. With graph-based data integration we propose a general method to support cross-
H. Tauscher, K. W. Wong
doaj +1 more source
A Framework for Rewriting Families of String Diagrams [PDF]
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
Pushdown Automata and Context-Free Grammars in Bisimulation Semantics [PDF]
The Turing machine models an old-fashioned computer, that does not interact with the user or with other computers, and only does batch processing. Therefore, we came up with a Reactive Turing Machine that does not have these shortcomings. In the Reactive
Jos C. M. Baeten +2 more
doaj +1 more source
Modeling and Reasoning over Distributed Systems using Aspect-Oriented Graph Grammars [PDF]
Aspect-orientation is a relatively new paradigm that introduces abstractions to modularize the implementation of system-wide policies. It is based on a composition operation, called aspect weaving, that implicitly modifies a base system by performing ...
Rodrigo Machado +2 more
doaj +1 more source
Learning the Morphological and Syntactic Grammars for Named Entity Recognition
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
A Solution to the Flowgraphs Case Study using Triple Graph Grammars and eMoflon [PDF]
After 20 years of Triple Graph Grammars (TGGs) and numerous actively maintained implementations, there is now a need for challenging examples and success stories to show that TGGs can be used for real-world bidirectional model transformations.
Anthony Anjorin, Marius Lauder
doaj +1 more source
Speeding up Generalized PSR Parsers by Memoization Techniques [PDF]
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

