Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Johanna Högberg"'
Publikováno v:
Scandinavian Journal of Forest Research. 30:547-557
Previous methods for estimating the market value of forestlands have often been based on net present production value. However, at least in Sweden, such methods are not sufficient to provide reasonable estimates of market prices of such properties no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ea1d9067be4892dcf073b56f08475a6
https://doi.org/10.1080/02827581.2015.1028434
https://doi.org/10.1080/02827581.2015.1028434
Publikováno v:
Acta Informatica. 48:165-189
We propose abstract observation tables, an abstract data type for learning deterministic weighted tree automata in Angluin’s minimal adequate teacher (MAT) model, and show that every correct implementation of abstract observation tables yields a co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89a63b1633981bc43f09c3c4a903a3dc
https://doi.org/10.1007/s00236-011-0135-x
https://doi.org/10.1007/s00236-011-0135-x
Publikováno v:
Fundamenta Informaticae. 92:103-130
Several models of automata are available that operate unranked trees. Two well-known examples are the stepwise unranked tree automaton (suta) and the parallel unranked tree automaton (puta). By adding a weight, taken from some semiring, to every tran
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4d7c742151fa704372d4c9a0f0c34f0
https://doi.org/10.3233/fi-2009-0068
https://doi.org/10.3233/fi-2009-0068
Publikováno v:
International Journal of Foundations of Computer Science. 18:699-713
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize nondeterministic tree automata (NTA) with respect to bisimulation. We show that our algorithm has
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df0452c180b99d3d1297ca640893ba56
https://doi.org/10.1142/s0129054107004929
https://doi.org/10.1142/s0129054107004929
Autor:
Johanna Högberg, Frank Drewes
Publikováno v:
Theory of Computing Systems. 40:163-185
We generalize an inference algorithm by Angluin, that learns a regular string language from a "minimally adequate teacher", to regular tree languages. The (deterministic bottom-up) finite tree automaton constructed by the learning algorithm is the mi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98f9a3eed833abf8870bd49b6f7296ff
https://doi.org/10.1007/s00224-005-1233-3
https://doi.org/10.1007/s00224-005-1233-3
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783642212536
LATA
LATA
Language models that use interleaving, or shuffle, operators have applications in various areas of computer science, including system verification, plan recognition, and natural language processing. We study the complexity of the membership problem f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bec9538fad7023fa68f98be10c9bde51
https://doi.org/10.1007/978-3-642-21254-3_10
https://doi.org/10.1007/978-3-642-21254-3_10
Autor:
Lisa Kaati, Johanna Högberg
Publikováno v:
FUSION
As the amount of information accessible to military intelligence continues to surge, operator assisted surveillance becomes less tractable. To process the information stream efficiently, automatic systems for threat detection are called for. These sy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4295d14faa93a1890cc6644268ed76f1
https://doi.org/10.1109/icif.2010.5711969
https://doi.org/10.1109/icif.2010.5711969
Autor:
Frank Drewes, Johanna Högberg
Publikováno v:
Algebraic Informatics ISBN: 9783540754138
CAI
CAI
We present an algebra whose operations act on musical pieces, and show how this algebra can be used to generate music in a tree-based fashion. Starting from input which is either generated by a regular tree grammar or provided by the user via a digit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d103ebcaa43e39f9a9580524eebb948f
https://doi.org/10.1007/978-3-540-75414-5_11
https://doi.org/10.1007/978-3-540-75414-5_11
Publikováno v:
Implementation and Application of Automata ISBN: 9783540763352
CIAA
CIAA
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Minimisation via forward bisimulation is also effective for deterministic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5bb69481585f4960997a4923e359b148
https://doi.org/10.1007/978-3-540-76336-9_12
https://doi.org/10.1007/978-3-540-76336-9_12
Publikováno v:
Developments in Language Theory ISBN: 9783540732075
Developments in Language Theory
Developments in Language Theory
We generalise existing forward and backward bisimulation minimisation algorithms for tree automata to weighted tree automata. The obtained algorithms work for all semirings and retain the time complexity of their unweighted variants for all additivel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a61904c269ad852d0ec4ddb80868f10
https://doi.org/10.1007/978-3-540-73208-2_23
https://doi.org/10.1007/978-3-540-73208-2_23