Automata Cascades: Expressivity and Sample Complexity
نویسندگان
چکیده
Every automaton can be decomposed into a cascade of basic prime automata. This is the Prime Decomposition Theorem by Krohn and Rhodes. Guided this theory, we propose automata cascades as structured, modular, way to describe complex systems made many components, each implementing specific functionality. Any serve component; using components allows for fine-grained control expressivity resulting class automata; implies guarantees. Moreover, specifying describing sample complexity in terms their components. We show that linear number maximum single component, modulo logarithmic factors. opens possibility learning representing large dynamical consisting parts interacting with other. It sharp contrast established understanding automata, described overall states input letters, which it only possible learn where amount data available. Instead our results one exponential
منابع مشابه
Logic between Expressivity and Complexity
Automated deduction is not just application or implementation of logical systems. The field of computational logic also poses deep challenges to our understanding of logic itself. I will discuss some key issues. This text is just an appetizer that will be elaborated in the lecture. 1 Logic and the Balance of Expressive Power and Computational Complexity Defining and proving/computing are the ma...
متن کاملHTN Planning: Complexity and Expressivity
Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) d ecomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks. networks are required to be totally ordered, and (3) whe...
متن کاملExpressivity and Complexity of MongoDB Queries
In this paper, we consider MongoDB, a widely adopted but not formally understood database system managing JSON documents and equipped with a powerful query mechanism, called the aggregation framework. We provide a clean formal abstraction of this query language, which we call MQuery. We study the expressivity of MQuery, showing the equivalence of its well-typed fragment with nested relational a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i8.26147