Abstract
We introduce planar directed acyclic graph algebras and present an explicit minimization method. The minimal simulation of a nondeterministic automaton on planar directed acyclic graphs is constructed.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Paper Title
Journal
Date
