Set of memories of a D-graph

DOI10.3103/S0278641910010073MaRDI QIDQ1759072zbMATH OpenFDO

Authors P. G. Sutyrin

Publication date 20 November 2012

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

equivalenceregularitycontext-free languageD-graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1203400
• A graph-based regularity test for deterministic context-free languages
• Efficient decision procedures for graph properties on context-free graph languages
• The complexity of connectivity problems on context-free graph languages
• scientific article; zbMATH DE number 4060748

Cites work

• scientific article; zbMATH DE number 3894828 (Why is no real title available?)
• A regularity test for pushdown machines
• Some definitions of the class of CF languages

Cited in

(1)

• scientific article; zbMATH DE number 1948512 (Why is no real title available?)

This page was built for publication: Set of memories of a D-graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759072)