Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties

DOI10.1142/S0129054120500203zbMath1458.68094OpenAlexW3039626237MaRDI QIDQ5859628

Ahmet Sinan Cevik

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120500203

zbMATH Keywords

first-order logicadjacency matrixformal languagesperfect matchingpalindromesinfinite strings1-regular graphscommitted graphsmodel theory of graphs

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Structural characterization of families of graphs (05C75) Applications of model theory (03C98)

Cites Work

• On Chomsky Hierarchy of Palindromic Languages
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Sums of Palindromes: an Approach via Automata
• Model Theory
• Two-Dimensional Palindromes and Their Properties
• On the categoricity in power of elementary deductive systems and some related problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties