Palindromic characteristic of committed graphs and some model theoretic properties

DOI10.1142/S0129054120500203zbMATH Open1458.68094OpenAlexW3039626237MaRDI QIDQ5859628FDOQ5859628

A. Sinan Çevik

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

Recommendations

• On Chomsky hierarchy of palindromic languages
• Palindromic graphs
• scientific article; zbMATH DE number 4033111
• Palindromic complexity of trees
• Model companions of theories of graphs

zbMATH Keywords

adjacency matrixfirst-order logicformal languagesperfect matchingpalindromesinfinite strings1-regular graphscommitted graphsmodel theory of graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• Title not available (Why is that?)
• Model Theory
• On Chomsky hierarchy of palindromic languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the categoricity in power of elementary deductive systems and some related problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Two-Dimensional Palindromes and Their Properties
• Title not available (Why is that?)
• Sums of Palindromes: an Approach via Automata
• Title not available (Why is that?)

This page was built for publication: Palindromic characteristic of committed graphs and some model theoretic properties

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