| Autor: |
Mikołaj Bojańczyk, Luc Segoufin, Howard Straubing |
| Jazyk: |
angličtina |
| Rok vydání: |
2012 |
| Předmět: |
|
| Zdroj: |
Logical Methods in Computer Science, Vol Volume 8, Issue 3 (2012) |
| Druh dokumentu: |
article |
| ISSN: |
1860-5974 |
| DOI: |
10.2168/LMCS-8(3:26)2012 |
| Popis: |
This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma_1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination of Sigma_1 sentences if and only if its syntactic monoid is J-trivial. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
