Johanna Björklund
According to our database1, Johanna Björklund
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:
-
at dl.acm.org
On csauthors.net:
Bibliography
2017
Finding the N best vertices in an infinite weighted hypergraph.
Theor. Comput. Sci., 2017
Syntactic methods for topic-independent authorship attribution.
Natural Language Engineering, 2017
An Evaluation of Structured Language Modeling for Automatic Speech Recognition.
J. UCS, 2017
Deterministic Stack Transducers.
Int. J. Found. Comput. Sci., 2017
On the Regularity and Learnability of Ordered DAG Languages.
Proceedings of the Implementation and Application of Automata, 2017
Minimization of Finite State Automata Through Partition Aggregation.
Proceedings of the Language and Automata Theory and Applications, 2017
2016
A Taxonomy of Minimisation Algorithms for Deterministic Tree Automata.
J. UCS, 2016
Polynomial inference of universal automata from membership and equivalence queries.
Inf. Comput., 2016
Deterministic Stack Transducers.
Proceedings of the Implementation and Application of Automata, 2016
My Name is Legion: Estimating Author Counts Based on Stylistic Diversity.
Proceedings of the 2016 European Intelligence and Security Informatics Conference, 2016
2015
An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring.
Proceedings of the Language and Automata Theory and Applications, 2015
MICO - Media in Context.
Proceedings of the 2015 IEEE International Conference on Multimedia & Expo Workshops, 2015
2014
Compression of finite-state automata through failure transitions.
Theor. Comput. Sci., 2014
2013
Simulation relations for pattern matching in directed graphs.
Theor. Comput. Sci., 2013
Shuffled languages - Representation and recognition.
Theor. Comput. Sci., 2013
MAT Learning of Universal Automata.
Proceedings of the Language and Automata Theory and Applications, 2013
2012
Aspects of plan operators in a tree automata framework.
Proceedings of the 15th International Conference on Information Fusion, 2012
2011
A randomised inference algorithm for regular tree languages.
Natural Language Engineering, 2011
MAT learners for tree series: an abstract data type and two realizations.
Acta Inf., 2011
Recognizing Shuffled Languages.
Proceedings of the Language and Automata Theory and Applications, 2011
2010
Weighted unranked tree automata as a framework for plan recognition.
Proceedings of the 13th Conference on Information Fusion, 2010
Detecting Social Positions Using Simulation.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2010
2009
Backward and forward bisimulation minimization of tree automata.
Theor. Comput. Sci., 2009
Bisimulation Minimisation of Weighted Automata on Unranked Trees.
Fundam. Inform., 2009
2007
Query Learning of Regular Tree Languages: How to Avoid Dead States.
Theory Comput. Syst., 2007
Bisimulation Minimization of Tree Automata.
Int. J. Found. Comput. Sci., 2007
Backward and Forward Bisimulation Minimisation of Tree Automata.
Proceedings of the Implementation and Application of Automata, 2007
Bisimulation Minimisation for Weighted Tree Automata.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007
An Algebra for Tree-Based Music Generation.
Proceedings of the Algebraic Informatics, Second International Conference, 2007
2006
Bisimulation Minimization of Tree Automata.
Proceedings of the Implementation and Application of Automata, 2006
2005
Random context tree grammars and tree transducers.
South African Computer Journal, 2005
Wind in the Willows - Generating Music by Means of Tree Transducers.
Proceedings of the Implementation and Application of Automata, 2005
2003
Learning a Regular Tree Language from a Teacher.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003