Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Janousek
- > Home > Persons > Jan Janousek
Publications
- 2020
[j14]Jan Trávnícek
, Jan Janousek, Borivoj Melichar, Loek Cleophas:
On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees. Theor. Comput. Sci. 830-831: 60-90 (2020)- 2018
- [c24]Eliska Sestáková, Borivoj Melichar, Jan Janousek:
Constrained Approximate Subtree Matching by Finite Automata. Stringology 2018: 79-90 - 2016
- [j12]Radomír Polách, Jan Trávnícek, Jan Janousek, Borivoj Melichar:
Efficient determinization of visibly and height-deterministic pushdown automata. Comput. Lang. Syst. Struct. 46: 91-105 (2016) - 2015
- [c20]Radomír Polách, Jan Travnicek, Jan Janousek, Borivoj Melichar:
A new algorithm for the determinisation of visibly pushdown automata. FedCSIS 2015: 915-922 - [c18]Jan Trávnícek, Jan Janousek, Borivoj Melichar, Loek G. Cleophas:
Backward Linearised Tree Pattern Matching. LATA 2015: 599-610 - 2014
- [c16]Jan Janousek, Borivoj Melichar, Radomír Polách, Martin Poliak, Jan Trávnícek:
A Full and Linear Index of a Tree for Tree Patterns. DCFS 2014: 198-209 - 2013
- [j9]Michalis Christou, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, Jan Zdárek:
Tree template matching in unranked ordered trees. J. Discrete Algorithms 20: 51-60 (2013) - 2012
- [j8]Jan Travnicek, Jan Janousek, Borivoj Melichar:
Indexing ordered trees for (nonlinear) tree pattern matching by pushdown automata. Comput. Sci. Inf. Syst. 9(3): 1125-1153 (2012) - [j7]Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Computing all subtree repeats in ordered trees. Inf. Process. Lett. 112(24): 958-962 (2012) - [j6]Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Tree template matching in ranked ordered trees by pushdown automata. J. Discrete Algorithms 17: 15-23 (2012) - [j5]Borivoj Melichar, Jan Janousek, Tomás Flouri:
Arbology: Trees and pushdown automata. Kybernetika 48(3): 402-428 (2012) - [j4]Jan Janousek, Borivoj Melichar, Martin Poliak:
Tree compression pushdown automaton. Kybernetika 48(3): 429-452 (2012) - 2011
- [c10]Jan Travnicek, Jan Janousek, Borivoj Melichar:
Nonlinear Tree Pattern Pushdown Automata. FedCSIS 2011: 871-878 - [c9]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis:
Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS 2011: 899-902 - [c8]Martin Plicka, Jan Janousek, Borivoj Melichar:
Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees. FedCSIS 2011: 903-906 - [c7]Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Computing All Subtree Repeats in Ordered Ranked Trees. SPIRE 2011: 338-343 - [c6]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis:
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. CIAA 2011: 273-281 - 2010
- [j3]Tomás Flouri, Jan Janousek, Borivoj Melichar:
Subtree matching by pushdown automata. Comput. Sci. Inf. Syst. 7(2): 331-357 (2010) - [c5]Tomás Flouri, Borivoj Melichar, Jan Janousek:
Aho-Corasick like multiple subtree matching by pushdown automata. SAC 2010: 2157-2158 - 2009
- [j2]Jan Janousek, Borivoj Melichar:
On regular tree languages and deterministic pushdown automata. Acta Informatica 46(7): 533-547 (2009) - [c4]Tomás Flouri, Borivoj Melichar, Jan Janousek:
Subtree matching by deterministic pushdown automata. IMCSIT 2009: 659-666 - 2001
- [j1]John Aycock, R. Nigel Horspool, Jan Janousek, Borivoj Melichar:
Even faster generalized LR parsing. Acta Informatica 37(9): 633-651 (2001) - 1997
- [c2]Jan Janousek, Borivoj Melichar:
Formal Translations Described by Translation Grammars with LR(k) Input Grammars. PLILP 1997: 421-422 - [c1]Jan Janousek, Borivoj Melichar:
The Output-Store Formal Translator Directed by LR Parsing. SOFSEM 1997: 432-439
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-02 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
