Abstract
The paper considers D-graphs that describe context-free languages (CFL). A new concept for the memory of a D-graph is introduced, and the properties of the set of memories of a D-graph are studied. The corresponding problems of analyzing the memories of a D-graph are set for known problems in the theory of deterministic CF languages, including the regularity test for a given CF language and the test for the equivalence of two given language descriptions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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: Moscow University Computational Mathematics and Cybernetics
Paper Title
Journal
Date
