default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGalina Jirásková
Galina Kumicáková-Jirásková
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c65]Jozef Jirásek, Galina Jirásková, Jeffrey O. Shallit:
State Complexity of the Minimal Star Basis. CIAA 2024: 195-207- 2023
- [j36]Galina Jirásková
, Giovanni Pighizzini:
Preface. J. Autom. Lang. Comb. 28(1-3): 3-4 (2023) - [c64]Michal Hospodár, Jozef Jirásek, Galina Jirásková, Juraj Sebej:
Operational Complexity: NFA-to-DFA Trade-Off. DCFS 2023: 79-93 - [c63]Michal Hospodár, Galina Jirásková:
Operational Complexity in Subregular Classes. CIAA 2023: 153-165 - [c62]Galina Jirásková:
Operations on Boolean and Alternating Finite Automata. AFL 2023: 3-10 - 2022
- [j35]Galina Jirásková, Stavros Konstantinidis:
Descriptional Complexity of Formal Systems (DCFS 2019). Inf. Comput. 284: 104686 (2022) - [j34]Galina Jirásková, Ondrej Klíma:
On linear languages recognized by deterministic biautomata. Inf. Comput. 286: 104778 (2022) - 2021
- [j33]Galina Jirásková, Cezar Câmpeanu:
Special Issue on Implementation and Application of Automata. Theor. Comput. Sci. 870: 1-2 (2021) - 2020
- [j32]Michal Hospodár, Galina Jirásková, Giovanni Pighizzini:
Preface. J. Autom. Lang. Comb. 25(2-3): 81-82 (2020) - [c61]Jozef Jirásek, Galina Jirásková:
Multiple Concatenation and State Complexity (Extended Abstract). DCFS 2020: 78-90 - [e4]Galina Jirásková, Giovanni Pighizzini:
Descriptional Complexity of Formal Systems - 22nd International Conference, DCFS 2020, Vienna, Austria, August 24-26, 2020, Proceedings. Lecture Notes in Computer Science 12442, Springer 2020, ISBN 978-3-030-62535-1 [contents]
2010 – 2019
- 2019
- [j31]Galina Jirásková:
Report on CIAA 2018. Bull. EATCS 127 (2019) - [j30]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Descriptional Complexity of the Forever Operator. Int. J. Found. Comput. Sci. 30(1): 115-134 (2019) - [j29]Galina Jirásková, Ivana Krajnáková:
Square on Deterministic, Alternating, and Boolean Finite Automata. Int. J. Found. Comput. Sci. 30(6-7): 1117-1134 (2019) - [j28]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Nondeterministic complexity in subclasses of convex languages. Theor. Comput. Sci. 787: 89-110 (2019) - [j27]Galina Jirásková, Alexander Okhotin:
State complexity of unambiguous operations on finite automata. Theor. Comput. Sci. 798: 52-64 (2019) - [c60]Galina Jirásková, Ivana Krajnáková:
NFA-to-DFA Trade-Off for Regular Operations. DCFS 2019: 184-196 - [c59]Galina Jirásková, Ondrej Klíma:
Deterministic Biautomata and Subclasses of Deterministic Linear Languages. LATA 2019: 315-327 - [e3]Michal Hospodár, Galina Jirásková, Stavros Konstantinidis:
Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Košice, Slovakia, July 17-19, 2019, Proceedings. Lecture Notes in Computer Science 11612, Springer 2019, ISBN 978-3-030-23246-7 [contents] - [e2]Michal Hospodár, Galina Jirásková:
Implementation and Application of Automata - 24th International Conference, CIAA 2019, Košice, Slovakia, July 22-25, 2019, Proceedings. Lecture Notes in Computer Science 11601, Springer 2019, ISBN 978-3-030-23678-6 [contents] - 2018
- [j26]Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej:
Operations on Unambiguous Finite Automata. Int. J. Found. Comput. Sci. 29(5): 861-876 (2018) - [j25]Michal Hospodár, Galina Jirásková:
The complexity of concatenation on deterministic and alternating finite automata. RAIRO Theor. Informatics Appl. 52(2-3-4): 153-168 (2018) - [c58]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
A Survey on Fooling Sets as Effective Tools for Lower Bounds on Nondeterministic Complexity. Adventures Between Lower Bounds and Higher Altitudes 2018: 17-32 - [c57]Michal Hospodár, Galina Jirásková, Ivana Krajnáková:
Operations on Boolean and Alternating Finite Automata. CSR 2018: 181-193 - [c56]Galina Jirásková, Alexander Okhotin:
State Complexity of Unambiguous Operations on Deterministic Finite Automata. DCFS 2018: 188-199 - [c55]Galina Jirásková, Alexander Okhotin:
Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata. DLT 2018: 441-452 - [c54]Jozef Jirásek, Galina Jirásková:
The Exact Complexity of Star-Complement-Star. CIAA 2018: 223-235 - [e1]Rudolf Freund, Michal Hospodár, Galina Jirásková, Giovanni Pighizzini:
Tenth Workshop on Non-Classical Models of Automata and Applications, NCMA 2018, Košice, Slovakia, August 21-22, 2018. Österreichische Computer Gesellschaft 2018, ISBN 978-3-903035-21-8 [contents] - 2017
- [j24]Galina Jirásková, Alexander Okhotin:
On the state complexity of operations on two-way finite automata. Inf. Comput. 253: 36-63 (2017) - [j23]Galina Jirásková, Alexander Szabari, Juraj Sebej:
The Complexity of Languages Resulting from the Concatenation Operation. J. Autom. Lang. Comb. 22(1-3): 123-143 (2017) - [c53]Ivana Krajnáková, Galina Jirásková:
Square on Deterministic, Alternating, and Boolean Finite Automata. DCFS 2017: 214-225 - [c52]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
On the Descriptive Complexity of $$\overline{\varSigma ^*\overline{L}}$$. DLT 2017: 222-234 - [c51]Galina Jirásková, Matús Palmovský:
Star-complement-star and Kuratowski algebras on prefix-free languages. NCMA 2017: 151-164 - [c50]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Nondeterministic Complexity of Operations on Free and Convex Languages. CIAA 2017: 138-150 - 2016
- [j22]Hae-Sung Eom, Yo-Sub Han, Galina Jirásková:
State Complexity of Basic Operations on Non-Returning Regular Languages. Fundam. Informaticae 144(2): 161-182 (2016) - [j21]Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej:
Prefix-free languages: Left and right quotient and reversal. Theor. Comput. Sci. 610: 78-90 (2016) - [c49]Galina Jirásková:
Self-Verifying Finite Automata and Descriptional Complexity. DCFS 2016: 29-44 - [c48]Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula:
On the State Complexity of the Shuffle of Regular Languages. DCFS 2016: 73-86 - [c47]Galina Jirásková, Alexander Szabari, Juraj Sebej:
The Complexity of Languages Resulting from the Concatenation Operation. DCFS 2016: 153-167 - [c46]Jozef Jirásek Jr., Galina Jirásková, Juraj Sebej:
Operations on Unambiguous Finite Automata. DLT 2016: 243-255 - [c45]Michal Hospodár, Galina Jirásková:
Concatenation on deterministic and alternating automata. NCMA 2016: 179-194 - [c44]Michal Hospodár, Galina Jirásková, Peter Mlynárcik:
Nondeterministic Complexity of Operations on Closed and Ideal Languages. CIAA 2016: 125-137 - 2015
- [j20]Jozef Jirásek, Galina Jirásková:
On the boundary of regular languages. Theor. Comput. Sci. 578: 42-57 (2015) - [c43]Jozef Stefan Jirásek, Galina Jirásková, Alexander Szabari:
Operations on Self-Verifying Finite Automata. CSR 2015: 231-261 - [c42]Jozef Jirásek, Galina Jirásková:
The Boundary of Prefix-Free Languages. DLT 2015: 300-312 - [i7]Janusz A. Brzozowski, Galina Jirásková, Bo Liu, Aayush Rajasekaran, Marek Szykula:
On the State Complexity of the Shuffle of Regular Languages. CoRR abs/1512.01187 (2015) - 2014
- [j19]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li, Joshua Smith:
Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Languages. Acta Cybern. 21(4): 507-527 (2014) - [j18]Galina Jirásková:
The Ranges of State Complexities for Complement, Star, and Reversal of Regular Languages. Int. J. Found. Comput. Sci. 25(1): 101- (2014) - [j17]Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou:
Quotient Complexity of Closed Languages. Theory Comput. Syst. 54(2): 277-292 (2014) - [c41]Jozef Jirásek, Galina Jirásková, Monika Krausová, Peter Mlynárcik, Juraj Sebej:
Prefix-Free Languages: Right Quotient and Reversal. DCFS 2014: 210-221 - [c40]Galina Jirásková, Peter Mlynárcik:
Complement on Prefix-Free, Suffix-Free, and Non-Returning NFA Languages. DCFS 2014: 222-233 - [c39]Stepan Holub, Galina Jirásková, Tomás Masopust:
On Upper and Lower Bounds on the Length of Alternating Towers. MFCS (1) 2014: 315-326 - [c38]Kristína Cevorová, Galina Jirásková, Ivana Krajnáková:
On the Square of Regular Languages. CIAA 2014: 136-147 - [c37]Galina Jirásková, Matús Palmovský, Juraj Sebej:
Kleene Closure on Regular and Prefix-Free Languages. CIAA 2014: 226-237 - [c36]Kristína Cevorová, Galina Jirásková, Peter Mlynárcik, Matús Palmovský, Juraj Sebej:
Operations on Automata with All States Final. AFL 2014: 201-215 - [i6]Galina Jirásková, Tomás Masopust:
On Upper and Lower Bounds on the Length of Alternating Towers. CoRR abs/1404.4495 (2014) - 2013
- [j16]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li:
Quotient complexity of ideal languages. Theor. Comput. Sci. 470: 36-52 (2013) - [c35]Jozef Jirásek, Galina Jirásková:
Cyclic Shift on Prefix-Free Languages. CSR 2013: 246-257 - [c34]Hae-Sung Eom, Yo-Sub Han, Galina Jirásková:
State Complexity of Basic Operations on Non-returning Regular Languages. DCFS 2013: 54-65 - [c33]Galina Jirásková, Tomás Masopust:
On the State Complexity of the Reverse of - and -Trivial Regular Languages. DCFS 2013: 136-147 - [c32]Galina Jirásková, Matús Palmovský:
Kleene Closure and State Complexity. ITAT 2013: 94-100 - [c31]Jozef Jirásek, Galina Jirásková:
On the Boundary of Regular Languages. CIAA 2013: 208-219 - [i5]Galina Jirásková, Tomás Masopust:
On the State Complexity of the Reverse of R- and J-trivial Regular Languages. CoRR abs/1304.0733 (2013) - 2012
- [j15]Galina Jirásková, Juraj Sebej:
Reversal of binary regular languages. Theor. Comput. Sci. 449: 85-92 (2012) - [j14]Galina Jirásková, Tomás Masopust:
On a structural property in the state complexity of projected regular languages. Theor. Comput. Sci. 449: 93-105 (2012) - [c30]Galina Jirásková:
Descriptional Complexity of Operations on Alternating and Boolean Automata. CSR 2012: 196-204 - [c29]Galina Jirásková, Ondrej Klíma:
Descriptional Complexity of Biautomata. DCFS 2012: 196-208 - [c28]Galina Jirásková, Jeffrey O. Shallit:
The State Complexity of Star-Complement-Star. Developments in Language Theory 2012: 380-391 - [c27]Galina Jirásková, Tomás Masopust:
On Properties and State Complexity of Deterministic State-Partition Automata. IFIP TCS 2012: 164-178 - [c26]Galina Jirásková, Benedek Nagy:
On Union-Free and Deterministic Union-Free Languages. IFIP TCS 2012: 179-192 - [c25]Galina Jirásková, Tomás Masopust:
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. CIAA 2012: 229-239 - [i4]Galina Jirásková, Jeffrey O. Shallit:
The state complexity of star-complement-star. CoRR abs/1203.5353 (2012) - 2011
- [j13]Galina Jirásková, Alexander Okhotin:
On the State Complexity of Star of Union and Star of Intersection. Fundam. Informaticae 109(2): 161-178 (2011) - [j12]Galina Jirásková, Giovanni Pighizzini:
Optimal simulation of self-verifying automata by deterministic automata. Inf. Comput. 209(3): 528-535 (2011) - [j11]Galina Jirásková:
Magic Numbers and Ternary Alphabet. Int. J. Found. Comput. Sci. 22(2): 331-344 (2011) - [j10]Galina Jirásková, Tomás Masopust:
Complexity in Union-Free Regular Languages. Int. J. Found. Comput. Sci. 22(7): 1639-1653 (2011) - [j9]Galina Jirásková:
Concatenation of Regular Languages and Descriptional Complexity. Theory Comput. Syst. 49(2): 306-318 (2011) - [c24]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li, Joshua Smith:
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages. AFL 2011: 123-137 - [c23]Galina Jirásková, Tomás Masopust:
State Complexity of Projected Languages. DCFS 2011: 198-211 - [c22]Galina Jirásková, Juraj Sebej:
Note on Reversal of Binary Regular Languages. DCFS 2011: 212-221 - [c21]Roland Cmorik, Galina Jirásková:
Basic Operations on Binary Suffix-Free Languages. MEMICS 2011: 94-102 - 2010
- [j8]Galina Jirásková, Alexander Okhotin:
Nondeterministic State Complexity of Positional Addition. J. Autom. Lang. Comb. 15(1/2): 121-133 (2010) - [c20]Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou:
Quotient Complexity of Closed Languages. CSR 2010: 84-95 - [c19]Galina Jirásková, Tomás Masopust:
Complexity in Union-Free Regular Languages. Developments in Language Theory 2010: 255-266 - [c18]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li:
Quotient Complexity of Ideal Languages. LATIN 2010: 208-221 - [c17]Galina Jirásková, Monika Krausová:
Complexity in Prefix-Free Regular Languages. DCFS 2010: 197-204 - [i3]Janusz A. Brzozowski, Galina Jirásková, Joshua Smith:
Quotient Complexity of Bifix-, Factor-, and Subword-Free Languages. CoRR abs/1006.4843 (2010)
2000 – 2009
- 2009
- [c16]Galina Jirásková:
Concatenation of Regular Languages and Descriptional Complexity. CSR 2009: 203-214 - [c15]Galina Jirásková:
Magic Numbers and Ternary Alphabet. Developments in Language Theory 2009: 300-311 - [c14]Galina Jirásková, Giovanni Pighizzini:
Converting Self-verifying Automata into Deterministic Automata. LATA 2009: 458-468 - [c13]Galina Jirásková, Pavol Olejár:
State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional Complexity. NCMA 2009: 151-166 - [c12]Galina Jirásková, Alexander Okhotin:
Nondeterministic State Complexity of Positional Addition. DCFS 2009: 151-161 - [i2]Janusz A. Brzozowski, Galina Jirásková, Baiyu Li:
Quotient complexity of ideal languages. CoRR abs/0908.2083 (2009) - [i1]Janusz A. Brzozowski, Galina Jirásková, Chenglong Zou:
Quotient Complexity of Closed Languages. CoRR abs/0912.1034 (2009) - 2008
- [j7]Jozef Jirásek, Galina Jirásková, Alexander Szabari:
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. Int. J. Found. Comput. Sci. 19(3): 617-631 (2008) - [j6]Galina Jirásková, Alexander Okhotin:
State complexity of cyclic shift. RAIRO Theor. Informatics Appl. 42(2): 335-360 (2008) - [c11]Galina Jirásková:
On the State Complexity of Complements, Stars, and Reversals of Regular Languages. Developments in Language Theory 2008: 431-442 - [c10]Galina Jirásková, Alexander Okhotin:
On the State Complexity of Operations on Two-Way Finite Automata. Developments in Language Theory 2008: 443-454 - 2007
- [c9]Jozef Jirásek, Galina Jirásková, Alexander Szabari:
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. Developments in Language Theory 2007: 254-265 - 2006
- [j5]Galina Jirásková:
Deterministic blow-ups of minimal NFA's. RAIRO Theor. Informatics Appl. 40(3): 485-499 (2006) - [j4]Galina Jirásková:
Note on the complexity of Las Vegas automata problems. RAIRO Theor. Informatics Appl. 40(3): 501-510 (2006) - 2005
- [j3]Jozef Jirásek, Galina Jirásková, Alexander Szabari:
State complexity of concatenation and complementation. Int. J. Found. Comput. Sci. 16(3): 511-529 (2005) - [j2]Galina Jirásková:
State complexity of some operations on binary regular languages. Theor. Comput. Sci. 330(2): 287-298 (2005) - [c8]Marek Hricko, Galina Jirásková, Alexander Szabari:
Union and Intersection of Regular Languages and Descriptional Complexity. DCFS 2005: 170-181 - [c7]Galina Jirásková, Alexander Okhotin:
State complexity of cyclic shift. DCFS 2005: 182-193 - 2004
- [c6]Galina Jirásková:
The Complexity of Las Vegas Automata Problems. DCFS 2004: 204-212 - [c5]Jozef Jirásek, Galina Jirásková, Alexander Szabari:
State Complexity of Concatenation and Complementation of Regular Languages. CIAA 2004: 178-189 - 2003
- [c4]Galina Jirásková:
Note on Minimal Automata and Uniform Communication Protocols. Grammars and Automata for String Processing 2003: 163-170 - [c3]Galina Jirásková:
State Complexity of Some Operations on Regular Languages. DCFS 2003: 114-125 - 2001
- [c2]Galina Jirásková:
Note on Minimal Finite Automata. MFCS 2001: 421-431
1980 – 1989
- 1989
- [j1]Galina Kumicáková-Jirásková:
Chomsky Hierarchy and Communication Complexity. J. Inf. Process. Cybern. 25(4): 157-164 (1989) - 1988
- [c1]Galina Jirásková:
Chomsky Hierarchy and Communication Complexity. IMYCS 1988: 12-18
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
