The height of piecewise-testable languages and the complexity of the logic of subwords

The height of a piecewise-testable language $L$ is the maximum length of the words needed to define $L$ by excluding and requiring given subwords. The height of $L$ is an important descriptive complexity measure that has not yet been investigated in a systematic way. This article develops a series o...

Celý popis

Podrobná bibliografie

Vydáno v:	Logical methods in computer science Ročník 15, Issue 2; číslo 2
Hlavní autoři:	Karandikar, Prateek, Schnoebelen, Philippe
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Logical Methods in Computer Science Association 01.04.2019 Logical Methods in Computer Science e.V
Témata:	Computer Science computer science - formal languages and automata theory computer science - logic in computer science f.3.1 f.4.1 f.4.3 F.4.3 Computer Science - Logic in Computer Science Computer Science - Formal Languages and Automata Theory F.3.1 F.4.1
ISSN:	1860-5974, 1860-5974
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!