Descriptional Complexity of Formal Systems: 18th IFIP WG 1.2 International Confe
69,13 €
Unrestricted State Complexity of Binary Operations on Regular Languages. - On the State Complexity of the Shue of Regular Languages. - MSO-denable properties of Muller context-free languages are decidable.
Jetzt bei Ebay: