Descriptional Complexity of Formal Systems: 23rd IFIP WG 1.02 International Conf
77,05 €
Complexity issues for the iterated h-preorders. - Commutative Regular Languages with Product-Form Minimal Automata. - State Complexity Bounds for Upward and Downward Closures on Commutative Languages and Commutative Group and Commutative Aperiodic Languages.
Jetzt bei Ebay: