Assisted Problem Solving and Decompositions of Finite Automata
classification
💻 cs.CC
keywords
automatadecompositionsfiniteassistedproblemsolvingdecomposabilitydecomposable
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.