Zobrazeno 1 - 10
of 263
pro vyhledávání: '"Sparse language"'
Autor:
Frank Vega
P versus NP is considered as one of the most important open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? A precise statement of the P versus NP problem was introduced independently by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::97c2efd58cdb2f45f3286d66648d76f0
Publikováno v:
LICS
This paper investigates the complexity of verbal languages and pattern languages of Thurston automatic groups in terms of the Chomsky hierarchy. Here the language generated by a pattern is taken as the set of representatives of all strings obtained w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::291fe914d59092b193e90f6148b6094e
https://doi.org/10.1016/j.jcss.2018.10.005
https://doi.org/10.1016/j.jcss.2018.10.005
Synthesised bigrams using word embeddings for code-switched ASR of four South African language pairs
Publikováno v:
Computer Speech & Language. 54:151-175
Code-switching is the phenomenon whereby multilingual speakers spontaneously alternate between more than one language during discourse and is widespread in multilingual societies. Current state-of-the-art automatic speech recognition (ASR) systems ar
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7858c27eec1fa08dddbff7a2322c7f1e
https://doi.org/10.1016/j.csl.2018.10.002
https://doi.org/10.1016/j.csl.2018.10.002
Publikováno v:
CCA
In this paper, we present a new property of relative observability, and based on this property, we propose two algorithms to deal with relative observability of regular languages. The first algorithm, that has polynomial complexity, verifies if a reg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59e2e4a67e80583d67b0b10b9cf4b115
https://doi.org/10.1109/tac.2016.2644640
https://doi.org/10.1109/tac.2016.2644640
Autor:
Andreas Krebs, Mai Gehrke
Publikováno v:
ACM SIGLOG News. 4:29-53
Complexity theory and the theory of regular languages both belong to the branch of computer science where the use of resources in computing is the main focus. However, they operate at different levels. While complexity theory seeks to classify comput
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ee572b6473214412d770456e43f64fa
https://doi.org/10.1145/3090064.3090068
https://doi.org/10.1145/3090064.3090068
Publikováno v:
Journal of the Korea Convergence Society. 8:219-229
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d47a44c366df6c55d440a7ffb7f79e0
https://doi.org/10.15207/jkcs.2017.8.4.219
https://doi.org/10.15207/jkcs.2017.8.4.219
Publikováno v:
Designs, Codes and Cryptography. 85:129-144
Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse systems common in cryptanalysis. Given a cipher system, one converts it into a system of sparse equations, and then the system
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09a0b6afcd3ae84d8d8142e8750ad87c
https://doi.org/10.1007/s10623-016-0294-4
https://doi.org/10.1007/s10623-016-0294-4
Publikováno v:
International Journal of Foundations of Computer Science. 27:863-878
It is well known that the resulting language obtained by inserting a regular language to a regular language is regular. We study the nondeterministic and deterministic state complexity of the insertion operation. Given two incomplete DFAs of sizes m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dd6bf79411a622ac1348ab0a91f7b409
https://doi.org/10.1142/s0129054116500349
https://doi.org/10.1142/s0129054116500349
Publikováno v:
Electronic Notes in Discrete Mathematics. 49:31-35
Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse system that are common in cryptanalysis. Given a cipher system, one converts it into a system of sparse equations, and then the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c6c7fcb40b101a3959593dc6683f284
https://doi.org/10.1016/j.endm.2015.06.006
https://doi.org/10.1016/j.endm.2015.06.006
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
The state complexity of basic operations on regular languages considering complete deterministic finite automata (DFA) has been extensively studied in the literature. But, if incomplete DFAs are considered, transition complexity is also a significant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87c64930c39de5d628784e0ba82c73b7
https://doi.org/10.1016/j.ic.2015.08.004
https://doi.org/10.1016/j.ic.2015.08.004