A note on the computational complexity of some problems for self-verifying finite automata
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
IFIG Research Report ; 1702 / 2017
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
Gießen
- (who)
-
Universitätsbibliothek
- (when)
-
2017
- Creator
- URN
-
urn:nbn:de:hebis:26-opus-126102
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:52 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Holzer, Markus
- Jakobi, Sebastian
- Universitätsbibliothek
Time of origin
- 2017
Other Objects (12)
Computational Complexity of Verifying Parameterized Systems
Self-verifying cellular automata
Verifying Opacity of Discrete-Timed Automata
Finite automata, formal logic, and circuit complexity
On the computational complexity of partial word automata problems
State Complexity of Basic Operations on Nondeterministic Finite Automata
The complexity of verifying population protocols
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Exploiting hierarchies in temporal logics, finite automata, arithmetics, and μ-calculus [my-calculus] for efficiently verifying reactive systems
Verifying probabilistic systems : new algorithms and complexity results
Self-Assembling Finite Automata
Second-Order Finite Automata
Computational Complexity of Verifying Parameterized Systems
Self-verifying cellular automata
Verifying Opacity of Discrete-Timed Automata
Finite automata, formal logic, and circuit complexity
On the computational complexity of partial word automata problems
State Complexity of Basic Operations on Nondeterministic Finite Automata
The complexity of verifying population protocols
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Exploiting hierarchies in temporal logics, finite automata, arithmetics, and μ-calculus [my-calculus] for efficiently verifying reactive systems
Verifying probabilistic systems : new algorithms and complexity results
Self-Assembling Finite Automata
Second-Order Finite Automata
Computational Complexity of Verifying Parameterized Systems
Self-verifying cellular automata
Verifying Opacity of Discrete-Timed Automata
Finite automata, formal logic, and circuit complexity
On the computational complexity of partial word automata problems
State Complexity of Basic Operations on Nondeterministic Finite Automata
The complexity of verifying population protocols
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Exploiting hierarchies in temporal logics, finite automata, arithmetics, and μ-calculus [my-calculus] for efficiently verifying reactive systems
Verifying probabilistic systems : new algorithms and complexity results
Self-Assembling Finite Automata