Titlebook: Descriptional Complexity of Formal Systems; 18th IFIP WG 1.2 Int Cezar Campeanu,Florin Manea,Jeffrey Shallit Conference proceedings 2016 IF

卡死偷電

鈍劍

On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection,sions extended with intersection only (also called semi-extended) can already be exponentially smaller than standard regular expressions or equivalent nondeterministic finite automata (.). For practical purposes it is important to study the average behaviour of conversions between these models. In t

特別容易碎

Unrestricted State Complexity of Binary Operations on Regular Languages,cted to be over the same alphabet, with . and . quotients, respectively, the state complexity of any binary boolean operation on . and . is ., and that of the product (concatenation) is .. In contrast to this, I show that if . and . are over their own different alphabets, the state complexity of uni

Accessible

licence

Contextual Array Grammars with Matrix and Regular Control,nal contextual array grammars are less powerful than matrix contextual array grammars, which themselves are less powerful than contextual array grammars with regular control languages. Yet in the 1-dimensional case, for a one-letter alphabet, the family of 1-dimensional array languages generated by

DOSE

有幫助

柱廊

Descriptional Complexity of Bounded Regular Languages,e costs for the determinization of nondeterministic finite automata accepting strongly bounded regular languages. The upper bound for the costs is larger than the costs for determinizing unary regular languages, but lower than the costs for determinizing arbitrary regular languages. In the second pa

Hyaluronic-Acid

The Complexity of Languages Resulting from the Concatenation Operation,d a minimal .-state DFA ., both?defined over an alphabet . with ., such that the minimal DFA for the language .(.).(.) has exactly . states. This improves a?similar result in the literature that uses an exponential alphabet.

偏離

Minimal and Reduced Reversible Automata,cerns the structure of the minimum automaton accepting the language under consideration. It is also observed that there exist reduced reversible automata which are not minimal, in the sense that all the automata obtained by merging some of their equivalent states are irreversible. Furthermore, it is