Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The height of piecewise-testable languages and the complexity of the logic ..."

Prateek Karandikar, Philippe Schnoebelen (2019)

> Home

Details and statistics

DOI: 10.23638/LMCS-15(2:6)2019

access: open

type: Journal Article

metadata version: 2020-06-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/lmcs/KarandikarS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/lmcs/KarandikarS19
Prateek Karandikar, Philippe Schnoebelen:
The height of piecewise-testable languages and the complexity of the logic of subwords. Log. Methods Comput. Sci. 15(2) (2019)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.