Selected publications
  • Aycock, J., Horspool, N., Janoušek, J., Melichar, B.: Even Faster Generalized LR Parsing. In: Acta Informatica, vol. 37, no. 9, pp. 633-651, Springer, Berlin, 2001. Available online here.  
  • Janousek, J., Melichar, B. On Regular Tree Languages and Deterministic Pushdown Automata. In Acta Informatica, Vol. 46, No. 7, pp. 533-547, Springer, 2009. Available online here. 
  • Flouri, T., Janousek , J., Melichar, B. Subtree matching and pushdown automata. In: COMSIS, Vol. 7, No.2, pp. 331-357, ComSIS Consortium, 2010.
  • Melichar, B., Janousek, J., Flouri, T. Arbology: Trees and Pushdown Automata. In: Kybernetika, vol. 48, No.3, pp. 402-428, 2012.
  • Poliak, M., Janousek, J., Melichar, B. Tree Compression Pushdown Automaton. In: Kybernetika, vol. 48, No.3, pp. 429-452, 2012.
  • Travnıcek, J., Janousek, J., Melichar, B.: Indexing Ordered Trees for (Nonlinear) Tree Pattern Matching by Pushdown Automata. In: Computer Science and Information Systems, Vol. 9, No. 3, pp. 1125-1154. 2012.
  • Christou, M., Crochemore, M., Flouri, T. Iliopoulos, C. Pissis, S. Janousek, J., Melichar, B. Computing all subtree repeats of ordered trees. In Information Processing Letters, vol 112, 24, pp. 958-962, Elsevier, 2012.
  • Michalis Christou, Tomas Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, and Jan Zdarek. Tree Template Matching in Unranked Ordered Trees. In Journal of Discrete Algorithms, 17, Elsevier, pp. 15-23, 2013.
  • Janousek , J. .Tree Indexing by Deteministic Automata. In: Dagstuhl reports, Vol.3, No. 5 (Tree Transducers and Formal Methods), Dagstuhl, p.6, 2013.
  • Jan Janousek, Borivoj Melichar, Radomır Polach, Martin Poliak, Jan Travnıcek: A Full and Linear Index of a Tree for Tree Patterns. In: LNCS 8614 (DCFS 2014), Springer, pp. 198-209, 2014.
  • Jan Travnicek, Jan Janousek, Borivoj Melichar and Loek G. Cleophas: Backward Linearised Tree Pattern Matching. In: LNCS 8977 (LATA 2015), Springer, pp. 599-610, 2015.
  • Radomír Polách, Jan Trávnícek, Jan Janousek, Borivoj Melichar: Efficient determinization of visibly and height-deterministic pushdown automata. In: Computer Languages, Systems & Structures, No. 46, pp. 91-105, Elsevier, 2016.
  • Janousek, J. String Suffix Automata and Subtree Pushdown Automata. In: Proceedings of the Prague Stringology Conference 2009, pp. 160--172, Czech Technical University in Prague, Prague, 2009. Available online here.
  • Flouri, T., Janousek , J., Melichar, B. Subtree Matching by Deterministic Pushdown Automata. In: Proceedings of the IMCSIT, Vol. 4, IEEE Computer Society Press, pp. 659-666, 2009.
  • Tomas Flouri, Costas Iliopoulos, Jan Janousek, Borivoj Melichar and Solon Pissis. Tree Template Matching in Ranked, Ordered Trees by Pushdown Automata. In: LNCS 6807 (CIAA 2011). Springer, pp. 273 - 281, 2011.
  • Janousek, J. Arbology: Algorithms on Trees and Pushdown Automata. Habilitation thesis, TU FIT Brno, 161 pages, 2010.
  • Flouri, T., Janousek , J., Melichar, B. Aho-Corasick like multiple subtree matching by deterministic pushdown automata. In: ACM SAC 2010 conference proceedings, 2010.
  • Janoušek, J., Melichar, B.: The Output-Store Formal Translator Directed by LR Parsing. In SOFSEM'97: Theory and Practice of Informatics. Berlin: Springer, 1997, p. 432-439.
  • Janoušek, J., Melichar, B.: Formal Translations Described by Translation Grammars with LR(k) Input Grammars. In Programming Languages: Implementations, Logics, and Programs. Berlin: Springer, 1997, p. 421-422.
  • Janousek, J. Some New Results in Sequential and Parallel (Generalized) LR Parsing and Translation. PhD. Thesis, CTU FEE Prague, 2001.
  • Janousek, J., Melichar, B. Subtree and Tree Pattern Pushdown Automata for Trees in Prefix Notation. Abstract In: LSD 2009 Talks' Abstracts, Department of Computer Science, King's College, London, p. 9.
  • Flouri, T., Melichar, B., Janousek, J. Tree Pattern Matching by Pushdown Automata. Abstract In: LSD 2009 Talks' Abstracts, Department of Computer Science, King's College, London
  • Melichar, B., Janousek, J. Repeats in Trees and Pushdown Automata. Abstract In: LSD 2009 Talks' Abstracts, Department of Computer Science, King's College, London, p. 12.
  • Flouri, T., Janousek , J., Melichar, B . Approximate Subtree Matching by Pushdown Automata. Presentation at LSD 2010 conference, London, 2010.
  • Plicka, M., Janousek , J., Melichar, B. Oracle Subtree Pushdown Automata for Trees. Presentation at LSD 2010 conference, London, 2010.
  • Stoklasa, J., Janousek , J., Melichar, B.Subtree Pushdown Automata for Trees in Bar Notation. Presentation at LSD 2010 conference, London, 2010. 
  • Travnicek, J. , Janousek, J., Melichar, B. Nonlinear Tree Pattern Pushdown Automata. Proceedings of the FEDCSIS 2011, IEEE Computer Society Press, pp. 871-878, 2011.
  • Plicka, M. , Janousek, J., Melichar, B.Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. Proceedings of the FEDCSIS 2011, IEEE Computer Society Press, pp. 903-906, 2011.
  • Flouri, T. , Iliopoulos, C., Janousek, J., Melichar, B., Pissis, S. Tree Indexing by Pushdown Automata and Repeats of Subtrees. Proceedings of the FEDCSIS 2011, IEEE Computer Society Press, pp. 899-902, 2011.
  • Christou, M., Crochemore, M., Flouri, T. Iliopoulos, C. Pissis, S. Janousek, J., Melichar, B. Computing all Subtree Repeats in Ordered Ranked Trees. In: LNCS 7024 (SPIRE 2011). Springer, pp. 338 - 343, 2011.
  • Polach, R., Janousek, J., Melichar, B. Tree expressions and pushdown automata, In: MEMICS 2011, Brno UT, pp. 70-77, 2011.

 

 

 

 

 
 

 

 

 

Citations by different authors in
  • Dick Grune and Ceriel J. H. Jacobs Parsing Techniques. A Practical Guide. 2nd edition.Originally published by Ellis Horwood Ltd, Prentice Hall. Springer, New York, ISBN: 978-0-387-20248-8, 2008
  • Nitin Indurkhya, Fred J Damerau (Eds.) Handbook Of Natural Language Processing, 2nd Edition. Chapman and Hall, ISBN: 978-1-4200-8592-1, 2010
  • Scott E, Johnstone A Generalized bottom up parsers with reduced stack activity. COMPUTER JOURNAL, ISSN 0010-4620, SCI Expanded, 2005
  • Johnstone A, Scott E Automatic recursion engineering of reduction incorporated parsers. SCIENCE OF COMPUTER PROGRAMMING, ISSN 0167-6423, SCI Expanded, 2007
  • Scott E, Johnstone A, Economopoulos R BRNGLR: A cubic tomita-style GLR parsing algorithm. ACTA INFORMATICA, ISSN 0001-5903, SCI, 2007
  • Okhotin A Generalized LR parsing algorithm for boolean grammars. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, ISSN 0129-0541, SCI Expanded, 2006
  • Li M, Wei ZG, Zhang J, et al. Improved GLR parsing algorithm. ADVANCES IN INTELLIGENT COMPUTING, PT 2, PROCEEDINGS, ISSN 0302-9743, SCI Expanded, 2005
  • Okhotin A LR parsing for Boolean grammars. DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, ISSN 0302-9743, SCI Expanded, 2005
  • McPeak S, Necula GC Elkhound: A fast, practical GLR parser generator. COMPILER CONSTRUCTION, PROCEEDINGS, ISSN 0302-9743, SCI Expanded, 2004
  • Johnstone A, Scott E, Economopoulos G Generalised parsing: Some costs. COMPILER CONSTRUCTION, PROCEEDINGS, ISSN 0302-9743, SCI Expanded, 2004
  • Scott E, Johnstone A Reducing non-determinism in right nulled GLR parsers. ACTA INFORMATICA, ISSN 0001-5903, SCI, 2004
  • Johnstone A, Scott E Generalised regular parsers. COMPILER CONSTRUCTION, PROCEEDINGS, ISSN 0302-9743, SCI Expanded, 2003
  • Malloy BA, Gibbs TH, Power JF Decorating tokens to facilitate recognition of ambiguous language constructs. SOFTWARE-PRACTICE & EXPERIENCE, ISSN 0038-0644, SCI Expanded, 2003
  • Ladislav Vagner and Bořivoj Melichar Parallel LL parsing. Acta Informatica, Volume 44, Number 1 , pp. 1-21, ISSN 0001-5903, SCI, 2007
  • Giorgios Economopoulos, Paul Klint and Jurgen VinjuFaster Scannerless GLR Parsing. COMPILER CONSTRUCTION, PROCEEDINGS, ISSN 0302-9743, SCI Expanded, 2009
  • Elizabeth Scott and Adrian Johnstone Recognition is not parsing -- SPPF-style parsing from cubic recognisers.Science of Computer Programming, ISSN 0167-6423, SCI Expanded, 2010
  • Robert J. Walker, Kevin Viggers Implementing protocols via declarative event patterns. ACM SIGSOFT Software Engineering Notes, Volume 29 , Issue 6, ISSN 0163-5948, 2004
  • Adrian Johnstone and Elizabeth Scott Recursion Engineering for Reduction Incorporated Parsers. Electronic Notes in Theoretical Computer Science, Volume 141, Issue 4, Pages 143-160, ISSN 1571-0661, 2005
  • Li H, Jin MZ, Xu F, Zhang M. Optimized GLR parsing for programming languages. Journal of Software, 16(2):174-183, ISSN 1000-9825, 2005
  • Scott McPeak Report No. UCB/CSD-2-1214. Computer Science Division (EECS) University of California, Berkeley, ISSN , 2002
  • Mark Hennessy A test-driven development strategy for the construction of grammar-based software. PHD. Thesis, Department of Computer Science, National University of Ireland, Maynooth, Co. Kildare, Ireland., ISSN , 2006
  • Elizabeth Scott and Adrian Johnstone Table based parsers with reduced stack activity. CSD-TR-02-08, Department of Computer Science, University of London, Egham, ISSN , 2002
  • Robert J. Walker and Kevin Viggers Communication History Patterns: Direct Implementation of Protocol Specifications. University of Calgary, ISSN , 2004
  • Alexander Okhotin A preliminary report on generalized LR parsing for Boolean grammars. Tech Report 2004-486, School of Computing, Queens University, 2004
  • Elizabeth Scott SPPF-Style Parsing From Earley Recognisers. ENTCS Volume 203,  Issue 2, pp. 53-67, Elsevier Science Publishers, ISSN 1571-0661, 2008
  • Jaakko Korpela Tomita-tyylisistä yleistetyistä LR-jäsentäjistä.
    MSC thesis, Tampereen yliopisto, Tietojenkäsittelytieteiden laitos,Tietojenkäsittelyoppi, 2004
  • Kevin Viggers and Robert J. Walker An Implementation of Declarative Event Patterns. Technical Report 2004-745-10, DCS, University of Calgary, Calgary, Alberta, Canada,2004
  • Ladislav Vagner Parallel LL Parsing and Its Applications. PHD thesis, DCSE FEE CTU, Prague, 2008
  • Giorgios Robert Economopoulos Generalised LR parsing algorithms. PHD thesis, DCS, Royal Holloway, University of London, 2006
  • XIAOQING WU  COMPONENT-BASED LANGUAGE IMPLEMENTATION WITH OBJECT-ORIENTED SYNTAX AND ASPECT-ORIENTED SEMANTICS. PHD thesis, The University of Alabama at Birmingham, BIRMINGHAM, ALABAMA,2007
  • G.R. Economopoulous, P. Klint, J.J. Vinju Faster scannerless GLR parsing. REPORT SEN-R0807,Centrum Wiskunde & Informatica, 2008
  • Adrian D. Thurston A Computer Language Transformation System Capable of Generalized Context-Dependent Parsing. PHD. thesis, Queen's University, Kingston, Ontario, Canada, 2008
  • Antti Jokipii GRAMMAR-BASED DATA EXTRACTION LANGUAGE. MSc. thesis, University of Jyväskylä, 2003
  • Adrian D. Thurston Generalized parsing techniques for Computer languages. Technical Report, Citeseer, 2007
  • Xu Fu  Jin Mao-zhong  Li Hu  Song Miao VPGE - A fast practical GLR parser generator. Computer Science & Education, ICCSE '09, 2009
  • Lahoda, J., Zdarek, J. : Simple Tree Pattern Matching for Trees in Prefix Bar Notation. In: Proceedings of the Prague Stringology Conference 2010 pp. 25--36, Czech Technical University in Prague, Prague, 2010.
  • Zdarek, J., Melichar. B. A Note on a Tree-Based 2d Indexing. In: CIAA 2010 (LNCS 6482), Springer Berlin, pp. 300–309, 2010.
  • Jabri, R.: A predictive bottom-up parser. In: Computing.
    Springer Wien, pp. 1-45, Doi: 10.1007/s00607-010-0134-8, 2010.
  • Melichar, B.: Arbology: Trees and Pushdown Automata. In: Language and Automata Theory and Applications (LNCS 6031). Springer Berlin, pp. 32-49, 2010.
  • Jabri, R. S.: A Generic Parser for Strings and Trees In: Computer Science and Information Systems, Vol. 9, No. 1, pp. 381-410, 2012.