Characterization of languages that can be represented by vertex-labeled graphs

MaRDI QIDQ2901684zbMATH OpenFDO

Authors I. S. Grunskij, E. A. Pryanichnikova

Publication date 31 July 2012

Published in Trudy Instituta Prikladnoĭ Matematiki i Mekhaniki (Search for Journal in Brave)

zbMATH Keywords

Myhill-Nerode theoremdirected vertex-labeled graphs

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Algebraic theory of languages and automata (68Q70)

Recommendations

• Algebra of languages representable in vertex-labelled graphs
• Mathematical Foundations of Computer Science 2005
• On algebra of languages representable by vertex-labeled graphs
• Linguistic representation of vertex-labeled graphs
• Languages which can be represented by completely labelled graphs

Cited in

(11)

• About a construction method of indistinguishability relations for vertex labeled graphs
• Characteristic of languages, representable in columns with noted tops
• On algebra of languages representable by vertex-labeled graphs
• scientific article; zbMATH DE number 5178192 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2005
• Linguistic representation of vertex-labeled graphs
• Separating \(k\)-separated eNCE graph languages
• Algebras of languages associated with labelled graphs
• Languages which can be represented by completely labelled graphs
• Algebra of languages representable in vertex-labelled graphs
• Domination on the vertices of labeled graphs

This page was built for publication: Characterization of languages that can be represented by vertex-labeled graphs

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