Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Konstantinidis, Stavros
77  Ergebnisse:
Personensuche X
?
1

On the average complexity of partial derivative transducers:

Konstantinidis, Stavros ; Machiavelo, António ; Moreira, Nelma.
Theoretical Computer Science.  956 (2023)  - p. 113830 , 2023
Link: https://doi.org/10.1016/..
 
?
2

Approximate NFA universality and related problems motivated..:

Konstantinidis, Stavros ; Mastnak, Mitja ; Moreira, Nelma.
Theoretical Computer Science.  972 (2023)  - p. 114076 , 2023
Link: https://doi.org/10.1016/..
 
?
3

Approximate NFA Universality Motivated by Information Theor:

, In: Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science,
Konstantinidis, Stavros ; Mastnak, Mitja ; Moreira, Nelma. - p. 142-154 , 2022
Link: https://doi.org/10.1007/..
 
?
4

Descriptional Complexity of Formal Systems (DCFS 2019):

Jirásková, Galina ; Konstantinidis, Stavros
Information and Computation.  284 (2022)  - p. 104686 , 2022
Link: https://doi.org/10.1016/..
 
?
5

Partial Derivative Automaton by Compressing Regular Express..:

, In: Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science,
Konstantinidis, Stavros ; Machiavelo, António ; Moreira, Nelma. - p. 100-112 , 2021
Link: https://doi.org/10.1007/..
 
?
6

On the size of partial derivatives and the word membership ..:

Konstantinidis, Stavros ; Machiavelo, António ; Moreira, Nelma.
Acta Informatica.  58 (2021)  4 - p. 357-375 , 2021
Link: https://doi.org/10.1007/..
 
?
7

Partial derivatives of regular expressions over alphabet-in..:

Konstantinidis, Stavros ; Moreira, Nelma ; Reis, Rogério
Theoretical Computer Science.  870 (2021)  - p. 103-120 , 2021
Link: https://doi.org/10.1016/..
 
?
8

On the Average State Complexity of Partial Derivative Trans..:

, In: SOFSEM 2020: Theory and Practice of Computer Science; Lecture Notes in Computer Science,
Konstantinidis, Stavros ; Machiavelo, António ; Moreira, Nelma. - p. 174-186 , 2020
Link: https://doi.org/10.1007/..
 
?
9

Theoretical and Implementational Aspects of the Formal Lang..:

, In: Lecture Notes in Computer Science; Beyond the Horizon of Computability,
Konstantinidis, Stavros - p. 289-295 , 2020
Link: https://doi.org/10.1007/..
 
?
10

Partitioning a Symmetric Rational Relation into Two Asymmet..:

, In: Implementation and Application of Automata; Lecture Notes in Computer Science,
Konstantinidis, Stavros ; Mastnak, Mitja ; Šebej, Juraj - p. 171-183 , 2019
Link: https://doi.org/10.1007/..
 
?
11

Descriptional Complexity of Formal Systems: 21st IFIP WG 1... 

Theoretical Computer Science and General Issues, 11612
Hospodár, Michal ; Jirásková, Galina ; Konstantinidis, Stavros - 1st ed. 2019 . , 2019
Link: https://doi.org/10.1007/..
 
?
12

Partial Derivatives of Regular Expressions over Alphabet-In..:

, In: Implementation and Application of Automata; Lecture Notes in Computer Science,
Konstantinidis, Stavros ; Moreira, Nelma ; Pires, João. - p. 184-196 , 2019
Link: https://doi.org/10.1007/..
 
?
13

Special section on Descriptional Complexity of Formal Syste..:

Konstantinidis, Stavros ; Pighizzini, Giovanni
Theoretical Computer Science.  798 (2019)  - p. 1 , 2019
Link: https://doi.org/10.1016/..
 
?
14

Transducer descriptions of DNA code properties and undecida..:

Kari, Lila ; Konstantinidis, Stavros ; Kopecki, Steffen
Information and Computation.  259 (2018)  - p. 237-258 , 2018
Link: https://doi.org/10.1016/..
 
?
15

Efficient Algorithms for Computing the Inner Edit Distance ..:

Kari, Lila ; Konstantinidis, Stavros ; Kopecki, Steffen.
Algorithms.  11 (2018)  11 - p. 165 , 2018
Link: https://doi.org/10.3390/..
 
1-15