Login / Signup
Universality of Confluent, Self-Loop Deterministic Partially Ordered NFAs is Hard.
Tomás Masopust
Markus Krötzsch
Published in:
CoRR (2017)
Keyphrases
</>
partially ordered
partial order
totally ordered
partial ordering
event calculus
cellular automata
possibilistic logic
interval valued
regular expressions
feedback loop
total ordering
database
regular languages
finite state machines
total order
black box
relational databases