Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDJohanna Björklund
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j19]Johanna Björklund
, Loek Cleophas:
Aggregation-based minimization of finite state automata. Acta Informatica 58(3): 177-194 (2021)- [j18]Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta:
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs. Theor. Comput. Sci. 870: 3-28 (2021) - [i2]Adam Dahlgren Lindström, Suna Bensch, Johanna Björklund, Frank Drewes:
Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case. CoRR abs/2102.11115 (2021) - [i1]Johanna Björklund, Frank Drewes, Anna Jonsson:
Polynomial Graph Parsing with Non-Structural Reentrancies. CoRR abs/2105.02033 (2021) - 2020
- [c22]Adam Dahlgren Lindström, Johanna Björklund, Suna Bensch, Frank Drewes:
Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case. COLING 2020: 730-744
2010 – 2019
- 2019
- [j17]Johanna Björklund, Frank Drewes, Niklas Zechner:
Efficient enumeration of weighted tree languages over the tropical semiring. J. Comput. Syst. Sci. 104: 119-130 (2019) - [c21]Johanna Björklund, Shay B. Cohen, Frank Drewes, Giorgio Satta:
Bottom-Up Unranked Tree-to-Graph Transducers for Translation into Semantic Graphs. FSMNLP 2019: 7-17 - [c20]Johanna Björklund, Frank Drewes, Giorgio Satta:
Z-Automata for Compact and Direct Representation of Unranked Tree Languages. CIAA 2019: 83-94 - 2018
- [c19]Johanna Björklund:
Tree-to-Graph Transductions with Scope. DLT 2018: 133-144 - [c18]Johanna Björklund, Frank Drewes, Anna Jonsson:
A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata. CIAA 2018: 97-108 - 2017
- [j16]Suna Bensch, Johanna Björklund, Martin Kutrib:
Deterministic Stack Transducers. Int. J. Found. Comput. Sci. 28(5): 583-602 (2017) - [j15]Johanna Björklund, Loek Cleophas, My Karlsson:
An Evaluation of Structured Language Modeling for Automatic Speech Recognition. J. Univers. Comput. Sci. 23(11): 1019-1034 (2017) - [j14]Johanna Björklund, Niklas Zechner:
Syntactic methods for topic-independent authorship attribution. Nat. Lang. Eng. 23(5): 789-806 (2017) - [j13]Johanna Björklund, Frank Drewes, Anna Jonsson:
Finding the N best vertices in an infinite weighted hypergraph. Theor. Comput. Sci. 682: 30-41 (2017) - [c17]Johanna Björklund, Loek Cleophas:
Minimization of Finite State Automata Through Partition Aggregation. LATA 2017: 223-235 - [c16]Henrik Björklund, Johanna Björklund, Petter Ericson:
On the Regularity and Learnability of Ordered DAG Languages. CIAA 2017: 27-39 - 2016
- [j12]Johanna Björklund, Henning Fernau, Anna Kasprzik:
Polynomial inference of universal automata from membership and equivalence queries. Inf. Comput. 246: 3-19 (2016) - [j11]Johanna Björklund, Loek Cleophas:
A Taxonomy of Minimisation Algorithms for Deterministic Tree Automata. J. Univers. Comput. Sci. 22(2): 180-196 (2016) - [c15]Johanna Björklund, Niklas Zechner:
My Name is Legion: Estimating Author Counts Based on Stylistic Diversity. EISIC 2016: 108-111 - [c14]Suna Bensch, Johanna Björklund, Martin Kutrib:
Deterministic Stack Transducers. CIAA 2016: 27-38 - 2015
- [c13]Patrick Aichroth, Christian Weigel, Thomas Kurz, Horst Stadler, Frank Drewes, Johanna Björklund, Kai Schlegel, Emanuel Berndl, Antonio Perez, Alex Bowyer, Andrea Volpini:
MICO - Media in Context. ICME Workshops 2015: 1-4 - [c12]Johanna Björklund, Frank Drewes, Niklas Zechner:
An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring. LATA 2015: 97-108 - 2014
- [j10]Henrik Björklund, Johanna Björklund, Niklas Zechner:
Compression of finite-state automata through failure transitions. Theor. Comput. Sci. 557: 87-100 (2014) - 2013
- [j9]Johanna Björklund, Lars-Daniel Öhman:
Simulation relations for pattern matching in directed graphs. Theor. Comput. Sci. 485: 1-15 (2013) - [j8]Martin Berglund, Henrik Björklund, Johanna Björklund:
Shuffled languages - Representation and recognition. Theor. Comput. Sci. 489-490: 1-20 (2013) - [c11]Johanna Björklund, Henning Fernau, Anna Kasprzik:
MAT Learning of Universal Automata. LATA 2013: 141-152 - 2012
- [c10]Johanna Björklund, Eric Jonsson, Lisa Kaati:
Aspects of plan operators in a tree automata framework. FUSION 2012: 1462-1467 - 2011
- [j7]Frank Drewes, Johanna Högberg, Andreas Maletti:
MAT learners for tree series: an abstract data type and two realizations. Acta Informatica 48(3): 165-189 (2011) - [j6]Johanna Högberg:
A randomised inference algorithm for regular tree languages. Nat. Lang. Eng. 17(2): 203-219 (2011) - [c9]Martin Berglund, Henrik Björklund, Johanna Högberg:
Recognizing Shuffled Languages. LATA 2011: 142-154 - 2010
- [c8]Joel Brynielsson, Johanna Högberg, Lisa Kaati, Christian Mårtenson, Pontus Svenson:
Detecting Social Positions Using Simulation. ASONAM 2010: 48-55 - [c7]Johanna Högberg, Lisa Kaati:
Weighted unranked tree automata as a framework for plan recognition. FUSION 2010: 1-8
2000 – 2009
- 2009
- [j5]Johanna Högberg, Andreas Maletti, Heiko Vogler:
Bisimulation Minimisation of Weighted Automata on Unranked Trees. Fundam. Informaticae 92(1-2): 103-130 (2009) - [j4]Johanna Högberg, Andreas Maletti, Jonathan May:
Backward and forward bisimulation minimization of tree automata. Theor. Comput. Sci. 410(37): 3539-3552 (2009) - 2007
- [j3]Parosh Aziz Abdulla, Johanna Högberg, Lisa Kaati:
Bisimulation Minimization of Tree Automata. Int. J. Found. Comput. Sci. 18(4): 699-713 (2007) - [j2]Frank Drewes, Johanna Högberg:
Query Learning of Regular Tree Languages: How to Avoid Dead States. Theory Comput. Syst. 40(2): 163-185 (2007) - [c6]Frank Drewes, Johanna Högberg:
An Algebra for Tree-Based Music Generation. CAI 2007: 172-188 - [c5]Johanna Högberg, Andreas Maletti, Jonathan May:
Bisimulation Minimisation for Weighted Tree Automata. Developments in Language Theory 2007: 229-241 - [c4]Johanna Högberg, Andreas Maletti, Jonathan May:
Backward and Forward Bisimulation Minimisation of Tree Automata. CIAA 2007: 109-121 - 2006
- [c3]Parosh Aziz Abdulla, Lisa Kaati, Johanna Högberg:
Bisimulation Minimization of Tree Automata. CIAA 2006: 173-185 - 2005
- [j1]Frank Drewes, Christine du Toit, Sigrid Ewert, Johanna Högberg, Brink van der Merwe, Andries P. J. van der Walt:
Random context tree grammars and tree transducers. South Afr. Comput. J. 34: 11-25 (2005) - [c2]Johanna Högberg:
Wind in the Willows - Generating Music by Means of Tree Transducers. CIAA 2005: 153-162 - 2003
- [c1]Frank Drewes, Johanna Högberg:
Learning a Regular Tree Language from a Teacher. Developments in Language Theory 2003: 279-291
Coauthor Index
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-06-06 00:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
