Assisted Problem Solving and Decompositions of Finite Automata
SOFSEM'08: Proceedings of the 34th conference on Current trends in theory and practice of computer science（2007）
摘要
A study of assisted problem solving formalized via decompositions of deterministic finite automata is initiated. The landscape of new types of decompositions of finite automata this study uncovered is presented. Languages with various degrees of decomposability between undecomposable and perfectly decomposable are shown to exist.
更多查看译文
关键词
deterministic finite automaton,finite automaton,new type,various degree,Assisted problem
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要