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影响因子(影响力)学科排名




书目名称Implementation and Application of Automata网络公开度




书目名称Implementation and Application of Automata网络公开度学科排名




书目名称Implementation and Application of Automata被引频次




书目名称Implementation and Application of Automata被引频次学科排名




书目名称Implementation and Application of Automata年度引用




书目名称Implementation and Application of Automata年度引用学科排名




书目名称Implementation and Application of Automata读者反馈




书目名称Implementation and Application of Automata读者反馈学科排名

移植

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

无可争辩

朴素