Assisted Problem Solving and Decompositions of Finite Automata

Computer Science – Computational Complexity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-179775

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.