Super - State Automata and Rational
نویسنده
چکیده
We introduce the notion of super-state automaton constructed from another automaton. This construction is used to solve an open question about enumerative sequences in rational trees. We prove that any IN-rational sequence s = (sn) n0 of nonnegative integers satisfying the Kraft inequality P n0 snk ?n 1 is the enumerative sequence of leaves by height of a k-ary rational tree. This result had been conjectured and was known only in the case of strict inequality. We also give a new proof of a result about enumerative sequences of nodes in k-ary rational trees.
منابع مشابه
Brzozowski Algorithm Is Generically Super-Polynomial Deterministic Automata
We study the number of states of the minimal automaton of the mirror of a rational language recognized by a random deterministic automaton with n states. We prove that, for any d > 0, the probability that this number of states is greater than n tends to 1 as n tends to infinity. As a consequence, the generic and average complexities of Brzozowski minimization algorithm are super-polynomial for ...
متن کاملBrzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata
We study the number of states of the minimal automaton of the mirror of a rational language recognized by a random deterministic automaton with n states. We prove that, for any d > 0, the probability that this number of states is greater than n tends to 1 as n tends to infinity. As a consequence, the generic and average complexities of Brzozowski minimization algorithm are super-polynomial for ...
متن کاملSuper-State Automata and Rational Trees
On introduit la notion d'automate des super-etats construit a partir d'un autre automate. Cette construction est utilis ee pour r esoudre un probl eme ouvert relatif aux suites enum eratives des feuilles d'arbres rationnels. On prouve qu'une suite N-rationnelle s = (s n) n0 d'entiers positif qui satis-fait l'in egalit e de Kraft : P n0 s n k ?n 1 est la suite enum erative selon la hauteur des f...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملDeciding Word Problems of Semigroups using Finite State Automata
We explore natural classes of finitely generated semigroups that have word problem decidable by synchronous or asynchronous two-tape finite state automata. Synchronous two-tape automata decide regular word problems and asynchronous automata decide rational word problems. We argue that asynchronous two-tape automata are a more suitable choice than synchronous two-tape automata and show that the ...
متن کامل