scientific article
From MaRDI portal
Publication:3886881
zbMath0443.68053MaRDI QIDQ3886881
Publication date: 1979
Full work available at URL: https://eudml.org/doc/92094
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
An equational axiomatization of systolic systems ⋮ The Syntactic Complexity of Eulerian Graphs ⋮ Morphismes et bimorphismes d'arbres ⋮ Syntactic recognizability of graphs with fuzzy attributes ⋮ An algebraic model of synchronous systems ⋮ A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization ⋮ Foundations of a theory of synchronous systems ⋮ Graph automata ⋮ Recognizability of graph and pattern languages ⋮ An axiomatization of graphs ⋮ On a code problem concerning planar acyclic graphs ⋮ Linear context-free tree languages and inverse homomorphisms ⋮ Formal computations of non deterministic recursive program schemes ⋮ Graph Automata: The Algebraic Properties of Abelian Relational Graphoids
Cites Work
This page was built for publication:
