Johanna Björklund

Petter Ericson

Int. J. Found. Comput. Sci., 2024

Thesis Proposal: Detecting Agency Attribution.

[BibT_eX]

[DOI]

Igor Ryazanov

Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics, 2024

2023

Transduction from trees to graphs through folding.

[BibT_eX]

[DOI]

Inf. Comput., December, 2023

Generating Semantic Graph Corpora with Graph Expansion Grammar.

[BibT_eX]

[DOI]

Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications, 2023

VOICE: Visual Oracle for Interaction, Conversation, and Explanation.

[BibT_eX]

[DOI]

CoRR, 2023

Generation and Polynomial Parsing of Graph Languages with Non-Structural Reentrancies.

[BibT_eX]

[DOI]

Comput. Linguistics, 2023

How Does the Language of 'Threat' Vary Across News Domains? A Semi-Supervised Pipeline for Understanding Narrative Components in News Contexts.

[BibT_eX]

[DOI]

Igor Ryazanov

Norbert Scherer-Negenborn

Proceedings of the 35th Annual Workshop of the Swedish Artificial Intelligence Society, 2023

The First Visual Object Tracking Segmentation VOTS2023 Challenge Results.

[BibT_eX]

[DOI]

Kannappan Palaniappan

Proceedings of the IEEE/CVF International Conference on Computer Vision, 2023

The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Parsing Unranked Tree Languages, Folded Once.

[BibT_eX]

[DOI]

Martin Berglund

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

AI-Driven Contextual Advertising: A Technology Report and Implication Analysis.

[BibT_eX]

[DOI]

Emil Häglund

CoRR, 2022

An Algebraic Approach to Learning and Grounding.

[BibT_eX]

[DOI]

Adam Dahlgren Lindström

CoRR, 2022

Improved N-Best Extraction with an Evaluation on Language Data.

[BibT_eX]

[DOI]

Comput. Linguistics, 2022

The Tenth Visual Object Tracking VOT2022 Challenge Results.

[BibT_eX]

[DOI]

Joni-Kristian Kämäräinen

Alireza Memarmoghadam

Christian Micheloni

Payman Moallem

Le Thanh Nguyen-Meidine

Proceedings of the Computer Vision - ECCV 2022 Workshops, 2022

2021

Bottom-up unranked tree-to-graph transducers for translation into semantic graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Polynomial Graph Parsing with Non-Structural Reentrancies.

[BibT_eX]

[DOI]

CoRR, 2021

Aggregation-based minimization of finite state automata.

[BibT_eX]

[DOI]

Acta Informatica, 2021

Bridging Perception, Memory, and Inference through Semantic Relations.

[BibT_eX]

[DOI]

Adam Dahlgren Lindström

Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing, 2021

Learning algorithms.

[BibT_eX]

[DOI]

Wim Martens

Proceedings of the Handbook of Automata Theory., 2021

2020

Probing Multimodal Embeddings for Linguistic Properties: the Visual-Semantic Case.

[BibT_eX]

[DOI]

Adam Dahlgren Lindström

Suna Bensch

Proceedings of the 28th International Conference on Computational Linguistics, 2020

2019

Efficient enumeration of weighted tree languages over the tropical semiring.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

Z-Automata for Compact and Direct Representation of Unranked Tree Languages.

[BibT_eX]

[DOI]

Giorgio Satta

Proceedings of the Implementation and Application of Automata, 2019

2018

A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2018

Tree-to-Graph Transductions with Scope.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

Finding the N best vertices in an infinite weighted hypergraph.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Syntactic methods for topic-independent authorship attribution.

[BibT_eX]

[DOI]

Nat. Lang. Eng., 2017

An Evaluation of Structured Language Modeling for Automatic Speech Recognition.

[BibT_eX]

[DOI]

My Karlsson

J. Univers. Comput. Sci., 2017

Deterministic Stack Transducers.

[BibT_eX]

[DOI]

Suna Bensch

Martin Kutrib

Int. J. Found. Comput. Sci., 2017

On the Regularity and Learnability of Ordered DAG Languages.

[BibT_eX]

[DOI]

Petter Ericson

Proceedings of the Implementation and Application of Automata, 2017

Minimization of Finite State Automata Through Partition Aggregation.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2017

2016

A Taxonomy of Minimisation Algorithms for Deterministic Tree Automata.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2016

Polynomial inference of universal automata from membership and equivalence queries.

[BibT_eX]

[DOI]

Henning Fernau

Anna Kasprzik

Inf. Comput., 2016

My Name is Legion: Estimating Author Counts Based on Stylistic Diversity.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2015

MICO - Media in Context.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Multimedia & Expo Workshops, 2015

2014

Compression of finite-state automata through failure transitions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

2013

Simulation relations for pattern matching in directed graphs.

[BibT_eX]

[DOI]

Lars-Daniel Öhman

Theor. Comput. Sci., 2013

Shuffled languages - Representation and recognition.

[BibT_eX]

[DOI]

Martin Berglund

Theor. Comput. Sci., 2013

MAT Learning of Universal Automata.

[BibT_eX]

[DOI]

Henning Fernau

Anna Kasprzik

Proceedings of the Language and Automata Theory and Applications, 2013

2012

Aspects of plan operators in a tree automata framework.

[BibT_eX]

[DOI]

Eric Jonsson

Lisa Kaati

Proceedings of the 15th International Conference on Information Fusion, 2012

2011

A randomised inference algorithm for regular tree languages.

[BibT_eX]

[DOI]

Nat. Lang. Eng., 2011

MAT learners for tree series: an abstract data type and two realizations.

[BibT_eX]

[DOI]

Acta Informatica, 2011

Recognizing Shuffled Languages.

[BibT_eX]

[DOI]

Martin Berglund

Proceedings of the Language and Automata Theory and Applications, 2011

2010

Weighted unranked tree automata as a framework for plan recognition.

[BibT_eX]

[DOI]

Lisa Kaati

Proceedings of the 13th Conference on Information Fusion, 2010

Detecting Social Positions Using Simulation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2010

2009

Backward and forward bisimulation minimization of tree automata.

[BibT_eX]

[DOI]

Jonathan May

Theor. Comput. Sci., 2009

Bisimulation Minimisation of Weighted Automata on Unranked Trees.

[BibT_eX]

[DOI]

Heiko Vogler

Fundam. Informaticae, 2009

2007

Contributions to the theory and applications of tree languages.

[BibT_eX]

[DOI]

PhD thesis, 2007

Query Learning of Regular Tree Languages: How to Avoid Dead States.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2007

Bisimulation Minimization of Tree Automata.

[BibT_eX]

[DOI]

Parosh Aziz Abdulla

Lisa Kaati

Int. J. Found. Comput. Sci., 2007

Backward and Forward Bisimulation Minimisation of Tree Automata.

[BibT_eX]

[DOI]

Jonathan May

Proceedings of the Implementation and Application of Automata, 2007

Bisimulation Minimisation for Weighted Tree Automata.

[BibT_eX]

[DOI]

Jonathan May

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

An Algebra for Tree-Based Music Generation.

[BibT_eX]

[DOI]

Andries P. J. van der Walt

Proceedings of the Algebraic Informatics, Second International Conference, 2007

2005

Random context tree grammars and tree transducers.

[BibT_eX]

[DOI]

South Afr. Comput. J., 2005

Wind in the Willows - Generating Music by Means of Tree Transducers.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2005

2003

Learning a Regular Tree Language from a Teacher.

[BibT_eX]

[DOI]