On language equations with one-sided concatenation

Franz Baader, Alexander Okhotin

Результат исследований: Научные публикации в периодических изданияхстатья

5 Цитирования (Scopus)


Language equations are equations where both the constants occurring in the equations and the solutions are formal languages. They have first been introduced in formal language theory, but are now also considered in other areas of computer science. In the present paper, we restrict the attention to language equations with one-sided concatenation, but in contrast to previous work on these equations, we allow not just union but all Boolean operations to be used when formulating them. In addition, we are not just interested in deciding solvability of such equations, but also in deciding other properties of the set of solutions, like its cardinality (finite, infinite, uncountable) and whether it contains least/greatest solutions. We show that all these decision problems are EXPTIME-complete.

Язык оригиналаанглийский
Страницы (с-по)1-35
Число страниц35
ЖурналFundamenta Informaticae
Номер выпуска1
СостояниеОпубликовано - 25 ноя 2013

Предметные области Scopus

  • Теоретические компьютерные науки
  • Алгебра и теория чисел
  • Информационные системы
  • Математика и теория расчета

Fingerprint Подробные сведения о темах исследования «On language equations with one-sided concatenation». Вместе они формируют уникальный семантический отпечаток (fingerprint).