Login / Signup

Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable.

Manfred DrosteZoltán FülöpDávid KószóHeiko Vogler
Published in: DCFS (2020)
Keyphrases
  • finite automata
  • tree automata
  • function symbols
  • machine learning
  • first order logic
  • natural language
  • object oriented
  • regular expressions
  • finite state