Computer Science – Computational Complexity
Scientific paper
2007-07-03
Computer Science
Computational Complexity
14 pages
Scientific paper
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.
Gaži Peter
Rovan Branislav
No associations
LandOfFree
Assisted Problem Solving and Decompositions of Finite Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Assisted Problem Solving and Decompositions of Finite Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Assisted Problem Solving and Decompositions of Finite Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-179775