The Topological Complexity of MSO+U and Related Automata Models

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-2012-728
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOS Press

Related search

Topological Complexity and Related Topics

Contemporary Mathematics
Mathematics
2018English

On the Decidability of MSO+U on Infinite Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

The Complexity of Interacting Automata

International Journal of Game Theory
StatisticsProbabilityUncertaintyEconomicsSocial SciencesMathematicsEconometrics
2015English

Regularization, Recognition and Complexity Estimation Methods of Automata Models of Discrete Dynamical Systems in Control Problem

American Journal of Management Science and Engineering
2017English

Topological and Time Dependence of the Action-Complexity Relation

Physical Review D
AstronomyPhysics
2018English

On the Complexity of Undecidable Problems in Automata Theory

1967English

On the Complexity of Semantic Equivalences for Pushdown Automata and BPA

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Classification of Elementary Cellular Automata Up to Topological Conjugacy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

On Properties and State Complexity of Deterministic State-Partition Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy