Algebra automata I: Parallel programming as a prolegomena to the categorical approach
From MaRDI portal
Publication:5549061
DOI10.1016/S0019-9958(68)90374-4zbMath0164.32201OpenAlexW2064937152WikidataQ114850261 ScholiaQ114850261MaRDI QIDQ5549061
Publication date: 1968
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(68)90374-4
Related Items
Mappings and grammars on trees, Unnamed Item, F‐Morphismen, Algebraic and Logical Operations on Operators One Application to Semantic Computation, Machines in a category, The generative power of delegation networks, More on advice on structuring compilers and proving them correct, Graph transformation for incremental natural language analysis, The congruence theory of closure properties of regular tree languages, Unnamed Item, Graph automata, Primitive recursive algebraic theories and program schemes, Program schemata as automata. I, The semigroup of an algebra automaton, Systematic approach to reduction and minimization in automata and system theory, From tree automata to string automata minimization, Generalized sequential machine maps, On the relevance of abstract algebra to control theory, Graph Automata: The Algebraic Properties of Abelian Relational Graphoids, Regular-like tree expressions, Transductions of dags and trees
