Travelled to:1 × Canada
1 × Hungary
1 × Latvia
1 × Portugal
1 × Spain
1 × Sweden
1 × United Kingdom
Collaborated with:G.Jirásková A.Meduna M.Thomazo J.Dassow ∅ J.Komenda J.H.v.Schuppen W.Czerwinski W.Martens
Talks about:complex (5) context (4) free (4) regular (3) languag (3) grammar (3) pushdown (2) automata (2) condit (2) union (2)
Person: Tomás Masopust
DBLP: Masopust:Tom=aacute=s
Contributed to:
2015
2015
2013
201220102011
2009
20082007Wrote 10 papers:
- CASE-2015-KomendaMS #coordination
- Relative observability in coordination control (JK, TM, JHvS), pp. 75–80.
- DLT-2015-MasopustT #automaton #complexity #on the #testing
- On the Complexity of k-Piecewise Testability and the Depth of Automata (TM, MT), pp. 364–376.
- ICALP-v2-2013-CzerwinskiMM #performance #regular expression #sequence
- Efficient Separability of Regular Languages by Subsequences and Suffixes (WC, WM, TM), pp. 150–161.
- 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-2010-DassowM #context-free grammar #on the #strict
- On Restricted Context-Free Grammars (JD, TM), pp. 434–435.
- 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.
- LATA-2009-Masopust #context-free grammar #generative #power of
- A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions (TM), pp. 554–565.
- AFL-2008-MasopustM #automaton #multi #on the
- On Pure Multi-Pushdown Automata that Perform Complete-Pushdown Pops (TM, AM), pp. 325–336.
- LATA-2007-MasopustM #complexity
- Descriptional Complexity of Grammars Regulated by Context Conditions (TM, AM), pp. 403–412.