Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Herrmann, Luisa"'
Autor:
Herrmann, Luisa, Osterholzer, Johannes
Publikováno v:
EPTCS 407, 2024, pp. 100-117
Parikh (tree) automata are an expressive and yet computationally well-behaved extension of finite automata -- they allow to increment a number of counters during their computations, which are finally tested by a semilinear constraint. In this work, w
Externí odkaz:
http://arxiv.org/abs/2409.06973
Autor:
Herrmann, Luisa, Mörbitz, Richard
We introduce global one-counter tree automata (GOCTA) which deviate from usual counter tree automata by working on only one counter which is passed through the tree in lexicographical order, rather than duplicating the counter at every branching posi
Externí odkaz:
http://arxiv.org/abs/2406.15090
We propose $\omega$MSO$\Join$BAPA, an expressive logic for describing countable structures, which subsumes and transcends both Counting Monadic Second-Order Logic (CMSO) and Boolean Algebra with Presburger Arithmetic (BAPA). We show that satisfiabili
Externí odkaz:
http://arxiv.org/abs/2305.01962
Autor:
Herrmann, Luisa
In this thesis, we investigate weighted tree automata with storage theoretically. This model generalises finite state automata in three dimensions: (i) from words to trees, (ii) by using an arbitrary storage type in addition to a finite-state control
Externí odkaz:
https://tud.qucosa.de/id/qucosa%3A74068
https://tud.qucosa.de/api/qucosa%3A74068/attachment/ATT-0/
https://tud.qucosa.de/api/qucosa%3A74068/attachment/ATT-0/
Autor:
Herrmann, Luisa, Ade, Johanna, Kühnel, Anne, Widmann, Annina, Demenescu, Liliana Ramona, Li, Meng, Opel, Nils, Speck, Oliver, Walter, Martin, Colic, Lejla
Publikováno v:
In Neurobiology of Stress July 2023 25
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol. 20 no. 1, Automata, Logic and Semantics (July 3, 2018) dmtcs:3664
We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids. Each weighted regular tree grammar with storage generates a weighted tree lan
Externí odkaz:
http://arxiv.org/abs/1705.06681
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We prove that the class of linear context-free tree languages is not closed under inverse linear tree homomorphisms. The proof is by contradiction: we encode Dyck words into a context-free tree language and prove that its preimage under a certain lin
Externí odkaz:
http://arxiv.org/abs/1510.04881
Publikováno v:
In Information and Computation December 2019 269