- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: Automata, languages and programming. Amsterdam [u.a.], 1973, S. 575-583
- Classification
-
Allgemeines, Wissenschaft
- Event
-
Veröffentlichung
- (where)
-
Paderborn
- (who)
-
Universitätsbibliothek
- (when)
-
1973
- Creator
- URN
-
urn:nbn:de:hbz:466:2-4308
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:50 PM CET
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
- Monien, Burkhard
- Universitätsbibliothek
Time of origin
- 1973
Other Objects (12)
Multiple Permitting and Bounded Turing Reducibilities
Multiple permitting and bounded turing reducibilities
Turing machines with sublogarithmic space
On Communicating Automata with Bounded Channels
On Turing machines, groupoids, and Atiyah problem
On structural similarities of finite automata and turing machine enumerability classes
Reachability for infinite time Turing machines with long tapes
A Time Hierarchy for Bounded One-Way Cellular Automata
On membership problems solvable by turing machines within polynomial time
Asymmetric term alignment with selective contiguity constraints by multi-tape automata
Turing machines with few accepting computations and low sets for PP
Formal verification of infinite-state systems : one-counter machines, register automata, and timed automata
Multiple Permitting and Bounded Turing Reducibilities
Multiple permitting and bounded turing reducibilities
Turing machines with sublogarithmic space
On Communicating Automata with Bounded Channels
On Turing machines, groupoids, and Atiyah problem
On structural similarities of finite automata and turing machine enumerability classes
Reachability for infinite time Turing machines with long tapes
A Time Hierarchy for Bounded One-Way Cellular Automata
On membership problems solvable by turing machines within polynomial time
Asymmetric term alignment with selective contiguity constraints by multi-tape automata
Turing machines with few accepting computations and low sets for PP
Formal verification of infinite-state systems : one-counter machines, register automata, and timed automata
Multiple Permitting and Bounded Turing Reducibilities
Multiple permitting and bounded turing reducibilities
Turing machines with sublogarithmic space
On Communicating Automata with Bounded Channels
On Turing machines, groupoids, and Atiyah problem
On structural similarities of finite automata and turing machine enumerability classes
Reachability for infinite time Turing machines with long tapes
A Time Hierarchy for Bounded One-Way Cellular Automata
On membership problems solvable by turing machines within polynomial time
Asymmetric term alignment with selective contiguity constraints by multi-tape automata
Turing machines with few accepting computations and low sets for PP