A finite axiomatization of flowchart schemes

@article{Bartha1977AFA,
  title={A finite axiomatization of flowchart schemes},
  author={Mikl{\'o}s Bartha},
  journal={Acta Cybern.},
  year={1977},
  volume={8},
  pages={203-217}
}

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-8 OF 8 CITATIONS

Reconstructing graphs from a deck of all distinct cards

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The monoidal structure of Turing machines

  • Mathematical Structures in Computer Science
  • 2013
VIEW 15 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Turing Automata and Graph Machines

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

On some equivalence notions of synchronous systems

VIEW 6 EXCERPTS
CITES BACKGROUND, RESULTS & METHODS
HIGHLY INFLUENCED

Quantum Turing automata

VIEW 2 EXCERPTS
CITES BACKGROUND & RESULTS

Simulation equivalence of automata and circuits

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

Similar Papers

Loading similar papers…