Results 191 to 200 of about 1,304 (204)
Some of the next articles are maybe not open access.
2021
Graph isomorphisms are adjacency and label (equivalence class) preserving one-to-one correspondences between vertex sets of possibly labelled graphs. The graph isomorphism problem is then the task of deciding whether two given graphs are isomorphic or not and basis of complexity class GI, containing all problems with polynomial reduction to former ...
openaire +1 more source
Graph isomorphisms are adjacency and label (equivalence class) preserving one-to-one correspondences between vertex sets of possibly labelled graphs. The graph isomorphism problem is then the task of deciding whether two given graphs are isomorphic or not and basis of complexity class GI, containing all problems with polynomial reduction to former ...
openaire +1 more source
Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems
International Conference on Formal Structures for Computation and Deduction, 2018Naoki Nishida, Yuya Maeda
semanticscholar +1 more source
Connex memories and rewriting systems
MELECON '98. 9th Mediterranean Electrotechnical Conference. Proceedings (Cat. No.98CH36056), 1998G. Stefan, R. Benea
semanticscholar +1 more source
Control Systems on Automata and Grammars
Computer/law journal, 2015Zhe Chen
semanticscholar +1 more source
Bridging Deterministic P Systems and Conditional Grammars
Int. Conf. on Membrane Computing, 2015A. Alhazov, R. Freund, Sergey Verlan
semanticscholar +1 more source
International Conference on Rewriting Techniques and Applications, 2011
Naoki Nishida +2 more
semanticscholar +1 more source
Naoki Nishida +2 more
semanticscholar +1 more source
On the Relation Between Graph Grammars and Graph L-Systems
International Symposium on Fundamentals of Computation Theory, 1977M. Nagl
semanticscholar +1 more source
Parallelism in Rewriting Systems
International Colloquium on Automata, Languages and Programming, 1974A. Salomaa
semanticscholar +1 more source
, 2007