- A Measure for the Degree of Nondeterminism of Context-Free Languages2007 | Faculty of Mathematics and Physics
- A Measure for the Degree of Nondeterminism of Context-Free Languages.2007 | Faculty of Mathematics and Physics
- A Measure for The Degree of nondeterminism of Context-Free Language,2007 | Faculty of Mathematics and Physics
- The Degree of Word-Expansion of Lexicalized RRWW-Automata: A New Measure for The Degree of Nondeterminism of (Context-Free) LanguagesPublication without faculty affiliation
- The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages2009 | Faculty of Mathematics and Physics
- Forgetting automata and context-free languages1996 | Faculty of Mathematics and Physics
- Erasing automata recognize more than context-free languages1995 | Publication without faculty affiliation
- Restarting automata and Marcus grammars and context-free languages1996 | Faculty of Mathematics and Physics
- Context-free Transformer-based Generative Lemmatiser for PolishPublication without faculty affiliation
- Pumping deterministic monotone restarting automata and DCFL2020 | Faculty of Mathematics and Physics
- One-Side Pumping and Two-Side Pumping by Complete CF(¢, $)-grammars2023 | Faculty of Mathematics and Physics
- On Pumping RP-automata Controlled by Complete LRG(\cent,$)-grammars2022 | Faculty of Mathematics and Physics
- Δ-Clearing Restarting Automata and CFL2011 | Faculty of Mathematics and Physics
- Δ-Clearing Restarting Automata and CFLPublication without faculty affiliation
- How to embed noncrossing trees in Universal Dependencies treebanks in a low-complexity regular languagePublication without faculty affiliation
- Reduction automata and syntactic errors2011 | Faculty of Mathematics and Physics
- Compressing permutation groups into grammars and polytopes. A graph embedding approach2020 | Faculty of Mathematics and Physics
- Some general results in combinatorial enumeration2010 | Faculty of Mathematics and Physics
- Transition-Based Coding and Formal Language Theory for Ordered DigraphsPublication without faculty affiliation
- Using Earley Parser for Recognizing Totally Ordered Hierarchical Plans2023 | Faculty of Mathematics and Physics
- A natural infinite hierarchy by free-order dependency grammars2006 | Faculty of Mathematics and Physics
- Notes on subsemigroups of N_0^m (+)2023 | Faculty of Education
- Two Results on Discontinuous Input Processing +12016 | Faculty of Mathematics and Physics
- On h-Lexicalized Automata and h-Syntactic Analysis2017 | Faculty of Mathematics and Physics
- Generalized linear list automata +12005 | Faculty of Mathematics and Physics
- On verification of workflow and planning domain models using attribute grammars2017 | Faculty of Mathematics and Physics
- On localization of (post)prefix (in)consistencies2012 | Faculty of Mathematics and Physics
- Deterministic ordered restarting automata for picture languages2015 | Faculty of Mathematics and Physics