Titlebook: Descriptional Complexity of Formal Systems; 20th IFIP WG 1.02 In Stavros Konstantinidis,Giovanni Pighizzini Conference proceedings 2018 IFI

太空

天真

Forward Injective Finite Automata: Exact and Random Generation of Nonisomorphic NFAs, to isomorphism. Using this representation an enumeration is given and an efficient uniform random generator is presented. We provide a conversion algorithm from a nondeterministic finite automaton or regular expression into an equivalent FIFA. Finally, we present some experimental results comparing

无法解释

A Local Limit Property for Pattern Statistics in Bicomponent Stochastic Models,c model for the random generation is defined by a rational formal series with non-negative real coefficients. The result yields a local limit towards a uniform density function and holds under the assumption that the formal series defining the model is recognized by a weighted finite state automaton

英寸

Mawkish

Cover Complexity of Finite Languages,ive a characterisation of the situations in which they collapse to a bounded complexity measure. Moreover, we show for a restricted class of context-free grammars that its grammatical cover complexity measure w.r.t. a finite language . is unbounded and that the cover complexity of . can be computed

好忠告人

轻率的你

TOM

低能儿

State Complexity of Unambiguous Operations on Deterministic Finite Automata,enation, and Kleene star operations on formal languages. For the disjoint union of languages represented by an .-state and an .-state DFA, the state complexity is .; for the unambiguous concatenation, it is known to be . (Daley et al. “Orthogonal concatenation: Language equations and state complexit

Priapism

Cycle Height of Finite Automata, has cycle height . for some .. We give a polynomial time algorithm to decide whether an NFA has finite cycle height and, in the positive case, to compute its optimal cycle height. Nondeterministic finite automata of finite cycle height recognize the polynomial density regular languages.