The Syntactic Complexity of Eulerian Graphs

DOI10.1007/978-3-540-75414-5_13MaRDI QIDQ3522868zbMATH OpenOpenAlexFDO

Authors Antonios Kalampakas

Publication date 4 September 2008

Published in Algebraic Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75414-5_13

zbMATH Keywords

graph language recognizability

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Recognizability of graph and pattern languages
• scientific article; zbMATH DE number 1740163
• scientific article; zbMATH DE number 617134
• On the Complexity of the Syntax of Tree Languages
• On the syntactic complexity of tree series

Cites work

• An axiomatization of graphs
• Context-free graph grammars and concatenation of graphs
• Exponential Numbers
• scientific article; zbMATH DE number 3692668 (Why is no real title available?)
• scientific article; zbMATH DE number 3607504 (Why is no real title available?)
• scientific article; zbMATH DE number 3316975 (Why is no real title available?)
• scientific article; zbMATH DE number 3367095 (Why is no real title available?)
• Recognizability of graph and pattern languages

Cited in

(2)

• Syntactic recognizability of graphs with fuzzy attributes
• On the syntactic complexity of tree series

This page was built for publication: The Syntactic Complexity of Eulerian Graphs

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