Assisted Problem Solving and Decompositions of Finite Automata

Simple item page
dc.creatorGaži, Peter
dc.creatorRovan, Branislav
dc.date2007-07-03
dc.date.accessioned2026-07-07T08:13:46Z
dc.date.available2026-07-07T08:13:46Z
dc.descriptionA 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.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/0707.0430
dc.identifierhttp://arxiv.org/abs/0707.0430
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132884
dc.subjectComputational Complexity
dc.subjectF.1.1; F.2.0
dc.titleAssisted Problem Solving and Decompositions of Finite Automata
dc.typetext

Files

Collections

arXiv