Approximate Nfa Universality and Related Problems Motivated by Information Theory 

AuthID
 P-00Y-RXY
4
Author(s)
Konstantinidis, S
·
Mastnak, M
·
Tipo de Documento
Article
Year published
2023
Publicado
in THEORETICAL COMPUTER SCIENCE, ISSN: 0304-3975
Volume: 972, Páginas: 114076 (16)
Indexing
Wos®
Scopus®
Dblp®
Crossref®2
Unpaywall®
Google Scholar®
Publication Identifiers
DBLP: journals/tcs/KonstantinidisMMR23a
SCOPUS: 2-s2.0-85166741221
Unpaywall: 10.1016/j.tcs.2023.114076
Wos: WOS:001053085700001
Source Identifiers
ISSN: 0304-3975
Export Publication Metadata
Lista Marked
 Adicionar à lista Marked
Citações
Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

CORE Conference
No information about CORE Rank

During the preprocessing phase, only publications of type 'Proceedings Paper' or 'Proceedings' are automatically processed to identify their CORE Rank.

TIP: If your publication's CORE Rank is missing, you can contact with your institutional manager to have the correct ranking manually added to the record.

Journal Factors
Oops! It looks like you don't have access to this content.

This section is restricted to uses with b-on access.

Info
At this moment we don't have any links to full text documens.

Um espaço para investigadores e suas Instituições

Links Úteis

Ajuda

© 2026 CRACS & Inesc TEC - All Rights Reserved Política de Privacidade | Terms of Service