Titlebook: Implementation and Application of Automata; 14th International C Sebastian Maneth Conference proceedings 2009 Springer-Verlag Berlin Heidel

營養(yǎng)品

書目名稱Implementation and Application of Automata影響因子(影響力)




書目名稱Implementation and Application of Automata影響因子(影響力)學(xué)科排名




書目名稱Implementation and Application of Automata網(wǎng)絡(luò)公開度




書目名稱Implementation and Application of Automata網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Implementation and Application of Automata被引頻次




書目名稱Implementation and Application of Automata被引頻次學(xué)科排名




書目名稱Implementation and Application of Automata年度引用




書目名稱Implementation and Application of Automata年度引用學(xué)科排名




書目名稱Implementation and Application of Automata讀者反饋




書目名稱Implementation and Application of Automata讀者反饋學(xué)科排名

法官

流浪者

監(jiān)禁

An ,log, Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton algorithm that computes for a given finite deterministic automaton (dfa) an almost equivalent dfa that is as small as possible—such an automaton is called hyper-minimal. Here two finite automata are almost equivalent if and only if the symmetric difference of their languages is finite. In other wor

影響帶來

On Extremal Cases of Hopcroft’s Algorithmthm has several degrees of freedom, so there can exist different sequences of refinements of the set of the states that lead to the final partition. We find an infinite family of binary automata for which such a process is unique. Some recent papers (cf. [3,7,1]) have been devoted to find families o

逃避系列單詞

Compact Normal Form for Regular Languages as Xor Automataterized by a finite dimension ., which is always smaller than the number . of states, and often exponentially so. The dimension is also the minimal number of states of all . (NXA) which accept the language. NXAs combine the advantages of deterministic automata (normal form, negation, minimization, e

PHON

Cellular Automata with Sparse Communications of the links between cells. It is shown that even the weakest non-trivial device in question, that is, one-way cellular automata where each two neighboring cells may communicate constantly often only, accept rather complicated languages. We investigate the computational capacity of the devices in

interference

addition

On Parallel Implementations of Deterministic Finite Automataof run of finite automata..First, we introduce the parallel DFA run methods for general DFA, which are universal, but due to the dependency of simulation time on the number of states |.| of automaton being run, they are suitable only for run of automata with the smaller number of states..Then we sho

ALT