"Comparing the succinctness of monadic query languages over finite trees."

Martin Grohe, Nicole Schweikardt (2004)

> Home

Details and statistics

DOI: 10.1051/ITA:2004017

access: closed

type: Journal Article

metadata version: 2020-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ita/GroheS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/GroheS04
Martin Grohe, Nicole Schweikardt:
Comparing the succinctness of monadic query languages over finite trees. RAIRO Theor. Informatics Appl. 38(4): 343-373 (2004)

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.