Login / Signup
Minimizing LR(1) State Machines is NP-Hard.
Wuu Yang
Published in:
CoRR (2021)
Keyphrases
</>
state machines
np hard
state machine
petri net
recurrent networks
logistic regression
scheduling problem
low resolution
approximation algorithms
computational complexity
optimal solution
special case
recurrent neural networks
lower bound
fault tolerant
social networks
sequence diagrams