Henrik Björklund

Available identifiers

zbMath Open bjorklund.henrikMaRDI QIDQ300255

List of research outcomes

Publication	Date of Publication	Type
Parsing unranked tree languages, folded once	2024-05-29	Paper
Tree-Based Generation of Restricted Graph Languages	2024-02-16	Paper
Transduction from trees to graphs through folding	2024-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q5094884	2022-08-04	Paper
Learning algorithms	2022-02-04	Paper
Uniform parsing for hyperedge replacement grammars	2021-03-10	Paper
Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey	2019-03-26	Paper
Conjunctive query containment over trees using schema information	2018-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q4599177	2017-12-18	Paper
On the regularity and learnability of ordered DAG languages	2017-08-22	Paper
Compression of finite-state automata through failure transitions	2016-06-27	Paper
Between a Rock and a Hard Place – Uniform Parsing for Hyperedge Replacement DAG Grammars	2016-04-13	Paper
Shuffled languages -- representation and recognition	2013-12-19	Paper
Validity of Tree Pattern Queries with Respect to Schema Information	2013-09-20	Paper
Cuts in Regular Expressions	2013-06-28	Paper
The tractability frontier for NFA minimization	2012-05-11	Paper
Recognizing Shuffled Languages	2011-06-03	Paper
Conjunctive query containment over trees	2011-05-04	Paper
Algorithmic Properties of Millstream Systems	2010-08-31	Paper
On notions of regularity for data languages	2010-02-09	Paper
Volker Weber	2010-01-06	Paper
Perspectives of System Informatics	2010-01-05	Paper
Optimizing Conjunctive Queries over Trees Using Schema Information	2009-02-03	Paper
Shuffle Expressions and Words with Nested Data	2008-09-17	Paper
The Tractability Frontier for NFA Minimization	2008-08-19	Paper
On Notions of Regularity for Data Languages	2008-02-26	Paper
Bounded Depth Data Trees	2007-11-28	Paper
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games	2007-02-19	Paper
Combinatorial structure and randomized subexponential algorithms for infinite games	2006-03-20	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
Memoryless determinacy of parity and mean payoff games: a simple proof	2004-10-27	Paper
https://portal.mardi4nfdi.de/entity/Q4418690	2003-08-11	Paper

Research outcomes over time

This page was built for person: Henrik Björklund