Self-certifying railroad diagrams. Or: how to teach nondeterministic finite automata

DOI10.1007/978-3-030-33636-3_5zbMath1434.68257OpenAlexW2980706408MaRDI QIDQ2176674

Ralf Hinze

Publication date: 5 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-33636-3_5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

A Finite Axiomatisation of Finite-State Automata Using String Diagrams ⋮ A string diagrammatic axiomatisation of finite-state automata

This page was built for publication: Self-certifying railroad diagrams. Or: how to teach nondeterministic finite automata