Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The complexity of concatenation on deterministic and alternating finite ..."

Michal Hospodár, Galina Jirásková (2018)

> Home

Details and statistics

DOI: 10.1051/ITA/2018011

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ita/HospodarJ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ita/HospodarJ18
Michal Hospodár, Galina Jirásková:
The complexity of concatenation on deterministic and alternating finite automata. RAIRO Theor. Informatics Appl. 52(2-3-4): 153-168 (2018)

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.