scientific article; zbMATH DE number 6744910

DOI10.4230/LIPIcs.FSTTCS.2015.84zbMath1366.03167arXiv1510.03994MaRDI QIDQ5278312

Philippe Schnoebelen, Prateek Karandikar

Publication date: 13 July 2017

Full work available at URL: https://arxiv.org/abs/1510.03994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

first-order logicdecidabilitysubwordsubsequenceSimon's congruencepiecewise testability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (8)

The Subtrace Order and Counting First-Order Logic ⋮ Unnamed Item ⋮ On the state complexity of closures and interiors of regular languages with subwords and superwords ⋮ Alternating complexity of counting first-order logic for the subword order ⋮ Existential Definability over the Subword Ordering ⋮ Well-Quasi Orders and Hierarchy Theory ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: