BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
1 × Japan
1 × Portugal
1 × Spain
1 × Taiwan
1 × United Kingdom
2 × Germany
2 × Hungary
3 × Canada
Collaborated with:
J.Jirásek T.Masopust A.Szabari K.Cevorová M.Palmovský J.Sebej J.Shallit G.Pighizzini A.Okhotin I.Krajnáková J.A.Brzozowski B.Li J.Smith P.Mlynárcik
Talks about:
languag (10) regular (9) complex (9) state (7) automata (6) free (5) complement (4) alphabet (4) determinist (3) boundari (3)

Person: Galina Jirásková

DBLP DBLP: Jir=aacute=skov=aacute=:Galina

Contributed to:

DLT 20152015
AFL 20142014
CIAA 20142014
CIAA 20132013
CIAA 20132015
CIAA 20122012
DLT 20122012
AFL 20112011
DLT 20102010
DLT 20102011
DLT 20092009
DLT 20092011
LATA 20092009
DLT 20082008
DLT 20072007
DLT 20072008
CIAA 20042004
CIAA 20042005

Wrote 20 papers:

DLT-2015-JirasekJ #bound
The Boundary of Prefix-Free Languages (JJ, GJ), pp. 300–312.
AFL-2014-CevorovaJMPS #automaton
Operations on Automata with All States Final (KC, GJ, PM, MP, JS), pp. 201–215.
CIAA-2014-CevorovaJK #on the #regular expression
On the Square of Regular Languages (KC, GJ, IK), pp. 136–147.
Kleene Closure on Regular and Prefix-Free Languages (GJ, MP, JS), pp. 226–237.
CIAA-2013-JirasekJ #bound #on the #regular expression
On the Boundary of Regular Languages (JJ, GJ), pp. 208–219.
CIAA-J-2013-JirasekJ15 #bound #on the #regular expression
On the boundary of regular languages (JJ, GJ), pp. 42–57.
CIAA-2012-JiraskovaM #complexity #on the
On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs (GJ, TM), pp. 229–239.
DLT-2012-JiraskovaS #complexity
The State Complexity of Star-Complement-Star (GJ, JS), pp. 380–391.
AFL-2011-BrzozowskiJLS #complexity #regular expression
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages (JAB, GJ, BL, JS), pp. 123–137.
DLT-2010-JiraskovaM #complexity #regular expression
Complexity in Union-Free Regular Languages (GJ, TM), pp. 255–266.
DLT-J-2010-JiraskovaM11 #complexity #regular expression
Complexity in Union-Free Regular Languages (GJ, TM), pp. 1639–1653.
Magic Numbers and Ternary Alphabet (GJ), pp. 300–311.
Magic Numbers and Ternary Alphabet (GJ), pp. 331–344.
LATA-2009-JiraskovaP #automaton #self #verification
Converting Self-verifying Automata into Deterministic Automata (GJ, GP), pp. 458–468.
DLT-2008-Jiraskova #complexity #on the #regular expression
On the State Complexity of Complements, Stars, and Reversals of Regular Languages (GJ), pp. 431–442.
DLT-2008-JiraskovaO #automaton #complexity #finite #on the
On the State Complexity of Operations on Two-Way Finite Automata (GJ, AO), pp. 443–454.
DLT-2007-JirasekJS #automaton #finite #nondeterminism
Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 254–265.
DLT-J-2007-JirasekJS08 #automaton #finite #nondeterminism
Deterministic blow-UPS of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 617–631.
CIAA-2004-JirasekJS #complexity #regular expression
State Complexity of Concatenation and Complementation of Regular Languages (JJ, GJ, AS), pp. 178–189.
CIAA-J-2004-JirasekJS05 #complexity
State complexity of concatenation and complementation (JJ, GJ, AS), pp. 511–529.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.