Languages which can be represented by completely labelled graphs

MaRDI QIDQ5746007zbMATH OpenFDO

Authors I. S. Grunskij, O. O. Pryanychnykova

Publication date 17 February 2014

zbMATH Keywords

algebra of languagescompletely labelled graphsformal languageregular expression

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Algebraic theory of languages and automata (68Q70)

Recommendations

• Algebras of languages associated with labelled graphs
• Algebra of languages representable in vertex-labelled graphs
• On algebra of languages representable by vertex-labeled graphs
• Mathematical Foundations of Computer Science 2005
• Characterization of languages that can be represented by vertex-labeled graphs

Cited in

(11)

• Separating \(k\)-separated eNCE graph languages
• Labelled stratified graphs can generate formal languages
• Characterization of languages that can be represented by vertex-labeled graphs
• Characteristic of languages, representable in columns with noted tops
• Algebra of languages representable in vertex-labelled graphs
• scientific article; zbMATH DE number 5178192 (Why is no real title available?)
• On algebra of languages representable by vertex-labeled graphs
• scientific article; zbMATH DE number 1222592 (Why is no real title available?)
• Two Algorithms For Languages Recognized By Graph Algebras
• Algebras of languages associated with labelled graphs
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Languages which can be represented by completely labelled graphs

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