A note on the computational complexity of some problems for self-verifying finite automata
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
IFIG Research Report ; 1702 / 2017
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Gießen
- (wer)
-
Universitätsbibliothek
- (wann)
-
2017
- Urheber
- URN
-
urn:nbn:de:hebis:26-opus-126102
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:51 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Holzer, Markus
- Jakobi, Sebastian
- Universitätsbibliothek
Entstanden
- 2017
Ähnliche Objekte (12)
Computational Complexity of Verifying Parameterized Systems
Self-verifying cellular automata
Finite automata, formal logic, and circuit complexity
Verifying Opacity of Discrete-Timed Automata
On the computational complexity of partial word automata problems
State Complexity of Basic Operations on Nondeterministic Finite Automata
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Verifying probabilistic systems : new algorithms and complexity results
Computational complexity
Self-Assembling Finite Automata
Exploiting hierarchies in temporal logics, finite automata, arithmetics, and μ-calculus [my-calculus] for efficiently verifying reactive systems
Kolmogorov complexity and computational complexity
Computational Complexity of Verifying Parameterized Systems
Self-verifying cellular automata
Finite automata, formal logic, and circuit complexity
Verifying Opacity of Discrete-Timed Automata
On the computational complexity of partial word automata problems
State Complexity of Basic Operations on Nondeterministic Finite Automata
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Verifying probabilistic systems : new algorithms and complexity results
Computational complexity
Self-Assembling Finite Automata
Exploiting hierarchies in temporal logics, finite automata, arithmetics, and μ-calculus [my-calculus] for efficiently verifying reactive systems
Kolmogorov complexity and computational complexity
Computational Complexity of Verifying Parameterized Systems
Self-verifying cellular automata
Finite automata, formal logic, and circuit complexity
Verifying Opacity of Discrete-Timed Automata
On the computational complexity of partial word automata problems
State Complexity of Basic Operations on Nondeterministic Finite Automata
On the Relative Descriptional Complexity of Regular Expressions and Finite Automata
Verifying probabilistic systems : new algorithms and complexity results
Computational complexity
Self-Assembling Finite Automata
Exploiting hierarchies in temporal logics, finite automata, arithmetics, and μ-calculus [my-calculus] for efficiently verifying reactive systems