The following pages link to Johanna Björklund (Q300256):
Displayed 21 items.
- Compression of finite-state automata through failure transitions (Q300258) (← links)
- Shuffled languages -- representation and recognition (Q388107) (← links)
- Simulation relations for pattern matching in directed graphs (Q388784) (← links)
- Polynomial inference of universal automata from membership and equivalence queries (Q899316) (← links)
- A comparison of two \(N\)-best extraction methods for weighted tree automata (Q1616962) (← links)
- Tree-to-graph transductions with scope (Q1622954) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Aggregation-based minimization of finite state automata (Q2035006) (← links)
- Learning algorithms (Q2074213) (← links)
- Z-automata for compact and direct representation of unranked tree languages (Q2177601) (← links)
- Finding the \(N\) best vertices in an infinite weighted hypergraph (Q2358678) (← links)
- On the regularity and learnability of ordered DAG languages (Q2399247) (← links)
- Efficient enumeration of weighted tree languages over the tropical semiring (Q2424678) (← links)
- An Efficient Best-Trees Algorithm for Weighted Tree Automata over the Tropical Semiring (Q2799165) (← links)
- Deterministic Stack Transducers (Q2830204) (← links)
- Learning Tree Languages (Q2963598) (← links)
- Deterministic Stack Transducers (Q4605515) (← links)
- MAT Learning of Universal Automata (Q4910453) (← links)
- Minimization of Finite State Automata Through Partition Aggregation (Q5738999) (← links)
- Transduction from trees to graphs through folding (Q6145530) (← links)
- Tree-Based Generation of Restricted Graph Languages (Q6195089) (← links)