Galina Jirásková: Curriculum Vitae

Education

• 1997-1998: PhD student, Mathematical Institute, Slovak Academy of Sciences
• 1982-1987: Faculty of Sciences, Safarik University, Košice, Slovakia
• 1978-1982: High School, Kováčska 30, Košice
• 1975-1978: Secondary School, Jenisejská 22, Kosice
• 1970-1975: Primary School, Medzilaborce

Academic degrees

• PhD: 1998 Mathematical Institute, Slovak Academy of Sciences
  • PhD thesis: Some Properties of Communication Complexity
  • Supervisor: Juraj Hromkovič
• MSc: 1987 Faculty of Sciences, Šafárik University, Košice
  • Master's thesis: The Complexity of Some Combinatorial Problems (in Slovak)
  • Supervisor: Peter Mihok (and J. Jirasek)

Work

• 1999-present: Research Fellow, Mathematical Institute, Slovak Academy of Sciences, Košice
• 1997-1998: PhD student, Mathematical Institute, Slovak Academy of Sciences, Košice
• 1989-1996: maternity leave
• 1987-1989: Research fellowship, Mathematical Institute, Slovak Academy of Sciences, Košice

Research interests

• communication complexity
• state complexity of regular languages
• Las Vegas finite automata
• ...

Talks

• On the boundary of regular languages, Brzozowski 80, 2015, Waterloo, Ontario, Canada
• On the square of regular languages, CIAA 2014, Giessen, Germany
• Kleene closure on regular and prefix-free languages, CIAA 2014, Giessen, Germany
• Operations on automata with all states final, AFL 2014, Szeged, Hungary
• Cyclic shift on prefix-free languages, CSR 2013, Ekaterinburg, Russia
• On the boundary of regular languages, CIAA 2013, Halifax, NS, Canada
• Descriptional complexity of operations on alternating and boolean automata, CSR 2012, Nizhny Novgorod
• The state complexity of star-complement-star, DLT 2012, Taipei, Taiwan
• Quotient complexity of bifix-, factor-, and subword-free regular languages, AFL 2011, Debrecen, Hungary
• Note on reversal of binary regular languages, DCFS 2011, Giessen/Limburg, Germany
• Basic operations on binary suffix-free languages, MEMICS 2011, Lednice, Czech Republic
• Quotient complexity of closed languages, CSR 2010, Kazan, Russia
• Complexity in prefix-free regular languages, DCFS 2010, Saskatoon, Canada
• Magic numbers and ternary alphabet (Best paper award), DLT 2009, Stuttgart, Germany
• State complexity of intersection and union of suffix-free languages and descriptional complexity, NCMA 2009, Wroclaw, Poland
• On the state complexity of complements, stars, and reversals of regular languages, DLT 2008, Kyoto, Japan
• Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet, DLT 2007, Turku, Finland
• Union and intersection of regular languages and descriptional complexity, DCFS 2005, Como, Italy
• The complexity of Las Vegas automata problems, DCFS 2004, London, Ontario, Canada
• State complexity of concatenation and complementation of regular languages, CIAA 2004, Kingston, Ontario, Canada
• State complexity of some operations on regular languages, DCFS 2003, Budapest, Hungary
• Note on minimal finite automata, MFCS 2001, Marianske Lazne, Czech Republic
• Chomsky hierarchy and communication complexity, IMYCS 1988, Smolenice, Czechoslovakia

<<<- back