On undecidability of concatenation theory for one-symbol languages

DOI10.1134/S1995080220020055zbMath1486.03073OpenAlexW3042696229MaRDI QIDQ2207016

Sergey M. Dudakov

Publication date: 27 October 2020

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080220020055

zbMATH Keywords

undecidabilitylanguagetheoryconcatenation

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30) Second- and higher-order arithmetic and fragments (03F35)

Related Items (1)

On decidability of theories of regular languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Growing commas. A study of sequentiality and concatenation
• On interpretability in the theory of concatenation
• Undecidability without arithmetization
• On decidability of regular languages theories

This page was built for publication: On undecidability of concatenation theory for one-symbol languages