Titlebook: Implementation and Application of Automata; 21st International C Yo-Sub Han,Kai Salomaa Conference proceedings 2016 Springer International

Monomania

書目名稱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é)科排名

移植

Deterministic Stack Transducersn automaton with the additional ability to move the stack head inside the stack without altering the contents. For stack transducers, we distinguish between a digging and a non-digging mode. In digging mode, the stack transducer can write on the output tape when its stack head is inside the stack, w

Intact

Derived-Term Automata of Multitape Rational Expressionsitape expressions such as .. We define expansions, which generalize the concept of derivative of a rational expression, but relieved from the need of a free monoid. We propose an algorithm based on expansions to build multitape automata from multitape expressions.

Hypomania

鬧劇

Ternary Equational Languages distributivity conditions as generalized truth values, and finitely decomposable algebras as data domains. When the algebra of data domains is a word or a tree algebra, fixed point equations may be interpreted as grammars and we obtain wide classes of (fuzzy) languages and tree languages.

隱士

BILK

A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 fota. Though it has been shown that the membership problem is solvable in linear time for graphs of bounded tree-width, the algorithm obtained in the previous study is unusable in practice because of a big hidden constant.

ALLAY

A Practical Simulation Result for Two-Way Pushdown Automataven pushdown automaton accepts a word, while the actual run of the automaton may take exponential time. The algorithm is practical since it only explores reachable configurations, simulates a class of quasi-deterministic decision problems in linear time even if the pushdown automaton is nondetermini

無可爭辯

樸素