Some notes on finite state languages and events represented by finite automata using labelled graphs
From MaRDI portal
Publication:5519137
DOI10.21136/CPM.1961.117361zbMath0143.25603OpenAlexW3048307127MaRDI QIDQ5519137
No author found.
Publication date: 1961
Full work available at URL: https://eudml.org/doc/20727
Related Items (4)
Syntactical definitions of program and flow diagram ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Extensions of rooted trees and their applications
This page was built for publication: Some notes on finite state languages and events represented by finite automata using labelled graphs