C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
From LTL to unambiguous Büchi automata via disambiguation of alternating automata.
Simon Jantsch
David Müller
Christel Baier
Joachim Klein
Published in:
Formal Methods Syst. Des. (2021)
Keyphrases
</>
deterministic automata
finite automata
cellular automata
co occurrence
finite state
tree automata
probabilistic automata
regular expressions
real time
learning algorithm
wordnet
lattice gas
formal language theory