| Title:
|
On the complexity of events recognizable in real time (English) |
| Author:
|
Nekvinda, Miloslav |
| Language:
|
English |
| Journal:
|
Kybernetika |
| ISSN:
|
0023-5954 |
| Volume:
|
9 |
| Issue:
|
1 |
| Year:
|
1973 |
| Pages:
|
(1)-10 |
| . |
| Category:
|
math |
| . |
| MSC:
|
03D05 |
| MSC:
|
68A25 |
| MSC:
|
68Q25 |
| MSC:
|
68Q45 |
| idZBL:
|
Zbl 0264.94039 |
| idMR:
|
MR0329320 |
| . |
| Date available:
|
2009-09-24T16:30:01Z |
| Last updated:
|
2012-06-04 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/124649 |
| . |
| Reference:
|
[1] Bečvář J.: Real-Time and Complexity Problems in Automata Theory.Kybernetika 1 (1965), 6, 475-497. |
| Reference:
|
[2] Fischer P. C.: Multi-tape and infinite-state automata.International Colloquium on Algebraic Linguistics and Automata Theory, 1964, Jerusalem, Israel. |
| Reference:
|
[3] Глушков B. M.: Синтез цифровых автоматов.Физматгиз, Москва 1962. Zbl 1005.68507 |
| Reference:
|
[4] Hartmanis J., Lewis P. M., Stearns R. E.: Classifications of Computations by time and memory requirements.IFIP Congress, New York 1965. Zbl 0203.16401 |
| Reference:
|
[5] Hartmanis J., Stearns R. E.: On the computational complexity of algorithms.Trans. Amer. Math. Soc. 117 (1965), 285-306. Zbl 0131.15404, MR 0170805 |
| Reference:
|
[6] Rabin M. O.: Real time computation.Israel J. of Math. 1 (1963), 203-211. Zbl 0156.25603, MR 0163849 |
| Reference:
|
[7] Yamada H.: Real-time computation and recursive functions not real-time computable.IRE Trans. on Electronic Computers EC-11 (1965), 753-760. MR 0152161 |
| Reference:
|
[8] Yamada H.: Counting by a class of growing automata.PhD Thesis, Moore School of Elect. Eng., University of Pennsylvania, 1960. |
| . |
