On the Complexity of Undecidable Problems in Automata Theory

doi 10.1109/focs.1967.23
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Probabilistic Automata on Finite Words: Decidable and Undecidable Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

On Miniaturized Problems in Parameterized Complexity Theory

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2006English

Upper Bounds on the Complexity of Some Galois Theory Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

The Complexity of Interacting Automata

International Journal of Game Theory
StatisticsProbabilityUncertaintyEconomicsSocial SciencesMathematicsEconometrics
2015English

On the Complexity of Semantic Equivalences for Pushdown Automata and BPA

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

On Properties and State Complexity of Deterministic State-Partition Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Highly Undecidable Problems About Recognizability by Tiling Systems

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy