Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
The height of piecewise-testable languages and the complexity of the logic of subwords
Saved in:
| Published in: | Logical Methods in Computer Science |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2019
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1864030187442667527 |
|---|---|
| collection | WordPress RSS FRELIP Feed Integration |
| container_title | Logical Methods in Computer Science |
| description | |
| discipline_display | Engineering & Technology |
| discipline_facet | Engineering & Technology |
| format | Online Article RSS Article |
| genre | Journal Article |
| id | rss_article:5831 |
| institution | FRELIP |
| journal_source_facet | Logical Methods in Computer Science |
| publishDate | 2019 |
| publishDateSort | 2019 |
| record_format | rss_article |
| spellingShingle | The height of piecewise-testable languages and the complexity of the logic of subwords Computer Science & Information Science Computer Science & IT Engineering & Technology |
| sub_discipline_display | Computer Science & IT |
| sub_discipline_facet | Computer Science & IT |
| subject_display | Computer Science & Information Science Computer Science & IT Engineering & Technology Computer Science & Information Science Computer Science & IT Engineering & Technology |
| subject_facet | Computer Science & Information Science Computer Science & IT Engineering & Technology |
| title | The height of piecewise-testable languages and the complexity of the logic of subwords |
| title_auth | The height of piecewise-testable languages and the complexity of the logic of subwords |
| title_full | The height of piecewise-testable languages and the complexity of the logic of subwords |
| title_fullStr | The height of piecewise-testable languages and the complexity of the logic of subwords |
| title_full_unstemmed | The height of piecewise-testable languages and the complexity of the logic of subwords |
| title_short | The height of piecewise-testable languages and the complexity of the logic of subwords |
| title_sort | the height of piecewise-testable languages and the complexity of the logic of subwords |
| topic | Computer Science & Information Science Computer Science & IT Engineering & Technology |
| url | https://doi.org/10.23638/LMCS-15(2:6)2019 |