Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345MaRDI QIDQ5492878zbMATH OpenOpenAlexFDO

Authors O. Kurganskyy, Igor Potapov, Igor Grunsky

Publication date 20 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11549345

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Characterization of languages that can be represented by vertex-labeled graphs
• Algebra of languages representable in vertex-labelled graphs
• scientific article; zbMATH DE number 2239801
• Languages which can be represented by completely labelled graphs
• On algebra of languages representable by vertex-labeled graphs

Cited in

(12)

• Separating \(k\)-separated eNCE graph languages
• About a construction method of indistinguishability relations for vertex labeled graphs
• 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
• Relative expressiveness of the edge/adjacency language for graph theory
• scientific article; zbMATH DE number 5178192 (Why is no real title available?)
• scientific article; zbMATH DE number 66075 (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?)
• Linguistic representation of vertex-labeled graphs
• Languages which can be represented by completely labelled graphs

This page was built for publication: Mathematical Foundations of Computer Science 2005

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