Titlebook: Descriptional Complexity of Formal Systems; 15th International W Helmut Jurgensen,Rogério Reis Conference proceedings 2013 Springer-Verlag

一瞥

装入胶囊

影响深远

Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Starymmetric differences and differences of two languages, one or both of which are starred, and for the product of two starred languages. We prove that the previously discovered bounds for the union and the intersection of languages with one or two starred arguments, for the product of two languages on

中古

粗野

State Complexity of Subtree-Free Regular Tree Languages,free regular tree languages. The state complexity of an operation for regular tree languages is the number of states that are sufficient and necessary in the worst-case for the minimal deterministic ranked tree automaton that accepts the tree language obtained from the operation. We establish the pr