scientific article; zbMATH DE number 4033111

MaRDI QIDQ3773369zbMATH OpenFDO

Authors Sándor Horváth, Juhani Karhumäki, Jetty Kleijn

Publication date 1987

zbMATH Keywords

palindromic languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Equivalence problem of mappings relative to languages
• On Chomsky hierarchy of palindromic languages
• Palindrome words and reverse closed languages
• Some results on primitive words, palindromes and polyslender languages
• scientific article; zbMATH DE number 2051172

Cited in

(11)

• Detecting palindromes, patterns and borders in regular languages
• Equivalence problem of mappings relative to languages
• Some decision problems concerning semilinearity and commutation.
• From decidability to undecidability by considering regular sets of instances
• On Chomsky hierarchy of palindromic languages
• Finite Automata, Palindromes, Powers, and Patterns
• Palindrome words and reverse closed languages
• The pseudopalindromic completion of regular languages
• Open problems related to palindrome recognition: are there open problems related to palindrome recognition?
• Palindromic characteristic of committed graphs and some model theoretic properties
• Additive Number Theory via Approximation by Regular Languages

This page was built for publication:

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