Suchergebnisse - "Theory of computation Formal languages and automata theory Formalisms Rewrite systems"

  • Treffer 1 - 3 von 3
Treffer weiter einschränken
  1. 1

    Infinite-state graph transformation systems under adverse conditions.

    Autoren: Özkan, Okan

    Quelle: IT: Information Technology; 2021, Vol. 63 Issue 5/6, p311-320, 10p

    Schlagwörter: PETRI nets, CHARTS, diagrams, etc., COMPUTER logic

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    PARTIAL ORDER INFINITARY TERM REWRITING.

    Autoren: BAHR, PATRICK

    Quelle: Logical Methods in Computer Science (LMCS); 2014, Vol. 10 Issue 2, p1-52, 52p

    Schlagwörter: INFINITY (Mathematics), MATHEMATICAL models, STOCHASTIC convergence, MATRICES (Mathematics), NORMALIZATION (Sociology)

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    THE COMPLEXITY OF THE FIRST-ORDER THEORY OF GROUND TREE REWRITE GRAPHS.

    Autoren: GÖLLER, STEFAN LOHREY, MARKUS

    Quelle: Logical Methods in Computer Science (LMCS); 2014, Vol. 10 Issue 1, p1-33, 33p

    Schlagwörter: COMPUTATIONAL complexity, FIRST-order logic, TREE graphs, GRAPH theory, MATCHING theory, MATHEMATICAL proofs

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: