Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An n2-bound for the ultimate equivalence problem of ..."

Juha Honkala (2005)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2005.05.003

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/Honkala05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/Honkala05
Juha Honkala:
An n²-bound for the ultimate equivalence problem of certain D0L systems over an n-letter alphabet. J. Comput. Syst. Sci. 71(4): 506-519 (2005)

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.