Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Jirásková, Galina
54  Ergebnisse:
Personensuche X
?
1

Operational Complexity: NFA-to-DFA Trade-Off:

, In: Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science,
Hospodár, Michal ; Jirásek, Jozef ; Jirásková, Galina. - p. 79-93 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Operational Complexity in Subregular Classes:

, In: Implementation and Application of Automata; Lecture Notes in Computer Science,
Hospodár, Michal ; Jirásková, Galina - p. 153-165 , 2023
Link: https://doi.org/10.1007/..
 
?
3

On linear languages recognized by deterministic biautomata:

Jirásková, Galina ; Klíma, Ondřej
Information and Computation.  286 (2022)  - p. 104778 , 2022
Link: https://doi.org/10.1016/..
 
?
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

Special Issue on Implementation and Application of Automata:

Jirásková, Galina ; Câmpeanu, Cezar
Theoretical Computer Science.  870 (2021)  - p. 1-2 , 2021
Link: https://doi.org/10.1016/..
 
?
6

Descriptional Complexity of Formal Systems: 22nd Internatio.. 

Theoretical Computer Science and General Issues, 12442
Jirásková, Galina ; Pighizzini, Giovanni - 1st ed. 2020 . , 2020
Link: https://doi.org/10.1007/..
 
?
7

Multiple Concatenation and State Complexity (Extended Abstr..:

, In: Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science,
Jirásek, Jozef ; Jirásková, Galina - p. 78-90 , 2020
Link: https://doi.org/10.1007/..
 
?
8

Implementation and Application of Automata: 24th Internatio.. 

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

State complexity of unambiguous operations on finite automa..:

Jirásková, Galina ; Okhotin, Alexander
Theoretical Computer Science.  798 (2019)  - p. 52-64 , 2019
Link: https://doi.org/10.1016/..
 
?
10

NFA-to-DFA Trade-Off for Regular Operations:

, In: Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science,
Jirásková, Galina ; Krajňáková, Ivana - p. 184-196 , 2019
Link: https://doi.org/10.1007/..
 
?
11

Deterministic Biautomata and Subclasses of Deterministic Li..:

, In: Language and Automata Theory and Applications; Lecture Notes in Computer Science,
Jirásková, Galina ; Klíma, Ondřej - p. 315-327 , 2019
Link: https://doi.org/10.1007/..
 
?
12

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/..
 
?
13

Nondeterministic complexity in subclasses of convex languag..:

Hospodár, Michal ; Jirásková, Galina ; Mlynárčik, Peter
Theoretical Computer Science.  787 (2019)  - p. 89-110 , 2019
Link: https://doi.org/10.1016/..
 
?
14

A Survey on Fooling Sets as Effective Tools for Lower Bound..:

, In: Adventures Between Lower Bounds and Higher Altitudes; Lecture Notes in Computer Science,
Hospodár, Michal ; Jirásková, Galina ; Mlynárčik, Peter - p. 17-32 , 2018
Link: https://doi.org/10.1007/..
 
?
15

Towards Exact State Complexity Bounds for Input-Driven Push..:

, In: Developments in Language Theory; Lecture Notes in Computer Science,
Jirásková, Galina ; Okhotin, Alexander - p. 441-452 , 2018
Link: https://doi.org/10.1007/..
 
1-15