Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Deciding Whether a Finite Set of Words has Rank at Most Two."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Jean Néraud (1993)

> Home

Details and statistics

DOI: 10.1016/0304-3975(93)90023-M

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Neraud93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Neraud93
Jean Néraud:
Deciding Whether a Finite Set of Words has Rank at Most Two. Theor. Comput. Sci. 112(2): 311-337 (1993)

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.