Set of memories of a D-graph

DOI10.3103/S0278641910010073zbMATH Open1448.68277MaRDI QIDQ1759072FDOQ1759072

Authors: P. G. Sutyrin 

Publication date: 20 November 2012

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

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

zbMATH Keywords

equivalenceregularitycontext-free languageD-graph

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• A regularity test for pushdown machines
• Some definitions of the class of CF languages

Cited In (1)

• Title not available (Why is that?)

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)