Representing hyper-graphs by regular languages

DOI10.1007/BFB0055807MaRDI QIDQ4218131zbMATH OpenFDO

Authors Salvatore La Torre, Margherita Napoli

Publication date 5 July 1999

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

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

zbMATH Keywords

infinite graphsregular language

Mathematics Subject Classification ID

Hypergraphs (05C65) Formal languages and automata (68Q45)

Recommendations

• Finite languages for the representation of finite graphs
• Languages which can be represented by completely labelled graphs
• Mathematical Foundations of Computer Science 2005
• Infinite hypergraphs. I: Basic properties

Cited in

(7)

• Finite languages for the representation of finite graphs
• Heterogeneous relation graphs as a formalism for representing linguistic information
• scientific article; zbMATH DE number 5999572 (Why is no real title available?)
• Automata-based Representations for Infinite Graphs
• (Re)introducing regular graph languages
• scientific article; zbMATH DE number 7301299 (Why is no real title available?)
• An internal presentation of regular graphs by prefix-recognizable graphs

This page was built for publication: Representing hyper-graphs by regular languages

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