Palindromic characteristic of committed graphs and some model theoretic properties
From MaRDI portal
Publication:5859628
Recommendations
Cites work
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 4033111 (Why is no real title available?)
- scientific article; zbMATH DE number 3739509 (Why is no real title available?)
- scientific article; zbMATH DE number 18979 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 3090153 (Why is no real title available?)
- An introduction to formal languages and automata.
- Finding maximal 2-dimensional palindromes
- Model Theory
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- On Chomsky hierarchy of palindromic languages
- On the categoricity in power of elementary deductive systems and some related problems
- Sums of Palindromes: an Approach via Automata
- Two-dimensional palindromes and their properties
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)