On decidability of theories of regular languages

DOI10.1007/s00224-020-09995-4OpenAlexW3049285863MaRDI QIDQ2043872

Boris Karlov, Sergey M. Dudakov

Publication date: 3 August 2021

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-020-09995-4

zbMATH Keywords

undecidabilityquantifier eliminationarithmeticregular languagestheoryKleene starunionconcatenation

Mathematics Subject Classification ID

Theory of computing (68Qxx) Sequences and sets (11Bxx) Discrete mathematics in relation to computer science (68Rxx) Number theory (11-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Growing commas. A study of sequentiality and concatenation
• On interpretability in the theory of concatenation
• Minimally generated Boolean algebras
• Undecidability without arithmetization
• On undecidability of concatenation theory for one-symbol languages
• On decidability of regular languages theories
• Computability and Logic
• Automatic Sequences

This page was built for publication: On decidability of theories of regular languages