Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Galina Jiraskova"'
Autor:
Galina Jirásková, Giovanni Pighizzini
This book constitutes the proceedings of the 22nd International Conference on Descriptional Complexity of Format Systems, DCFS 2020, which was supposed to take place in Vienna, Austria, in August 2020, but the conference was canceled due to the COVID
Autor:
Michal Hospodár, Galina Jirásková
This book constitutes the proceedings of the 24th International Conference on Implementation and Application of Automata, CIAA 2019, held in Kosice, Slovakia, in July 2019.The 17 regular papers presented together with 2 invited papers in this book we
This book constitutes the proceedings of the 21st International Conference on Descriptional Complexity of Format Systems, DCFS 2019, held in Košice, Slovakia, in July 2019. The 18 full papers presented in this volume were carefully reviewed and sele
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 151, Iss Proc. AFL 2014, Pp 201-215 (2014)
We study the complexity of basic regular operations on languages represented by incomplete deterministic or nondeterministic automata, in which all states are final. Such languages are known to be prefix-closed. We get tight bounds on both incomplete
Externí odkaz:
https://doaj.org/article/9cfc26082d2942a89c0e653d6478d9a7
Autor:
Galina Jirásková, Monika Krausová
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 31, Iss Proc. DCFS 2010, Pp 197-204 (2010)
We examine deterministic and nondeterministic state complexities of regular operations on prefix-free languages. We strengthen several results by providing witness languages over smaller alphabets, usually as small as possible. We next provide the ti
Externí odkaz:
https://doaj.org/article/29e2c2f45d784c788e4ee3c2acbc9d25
Autor:
Galina Jirásková, Alexander Okhotin
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 3, Iss Proc. DCFS 2009, Pp 151-161 (2009)
Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved that if two sets of numbers S and T are represented by nondeterminist
Externí odkaz:
https://doaj.org/article/9f8894ef34e648b2b19b0ad7126140e5