Skip to main content
Conference Proceedings

Assisted problem solving and decompositions of finite automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4910 LNCS 292-303
DOI: 10.1007/978-3-540-77566-9_25
6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Gaži, P., & Rovan, B. (2008). Assisted problem solving and decompositions of finite automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4910 LNCS, pp. 292–303). Springer Verlag. https://doi.org/10.1007/978-3-540-77566-9_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free