TWO APPLICATIONS OF PARALLEL FINITE STATE MACHINE EXECUTION

UNIVERSITY POLITEHNICA OF BUCHAREST SCIENTIFIC BULLETIN SERIES C-ELECTRICAL ENGINEERING AND COMPUTER SCIENCE（2017）

引用 0|浏览8

暂无评分

摘要

In this paper we present two results regarding finite state machines (also referred to as FSMs). They involve the concept of parallel finite state machine execution, which proves essential in outlining both findings. The first result concerns FSM equivalence with incomplete knowledge, where we determine the amount of information required about two black box automata that can be run on different inputs. The second leads to a method of testing whether a variable -length code is uniquely decodable.

查看译文

关键词

automata theory,finite state machine equivalence,product automaton,unique decodability

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要