Assisted problem solving and decompositions of finite automata

Authors:
Peter Gaži;Branislav Rovan
Affiliations:
Department of Computer Science, Comenius University, Bratislava, Slovakia;Department of Computer Science, Comenius University, Bratislava, Slovakia
Venue:
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Year:
2008

Citing 6
Cited 2

The complexity of promise problems with applications to public-key cryptography

Information and Control
Structural complexity 1

Structural complexity 1
Intersection and union of regular languages and state complexity

Information Processing Letters
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
State Complexity: Recent Results and Open Problems

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus

Simplifying DPDA using supplementary information

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Modeling time criticality of information

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.