Referenzen
| 13. |
On global word definability and constructively definable sets in {N_\mboxn}
CLAAP
, Seite 225--227.
1980
|
| 12. |
Decidability results on plane automata searching mazes
Fundamentals of computation theory (Proc. Conf. Algebraic, Arith. and Categorical Methods in Comput. Theory, Berlin/Wendisch-Rietz, 1979)
Band 2
aus Math. Res.
, Seite 84--91.
Herausgeber: Akademie-Verlag, Berlin,
1979
|
| 11. |
Equivalence results on probabilistic tree languages
Comment. Math. Prace Mat.,
20(1):111--131
1977
|
| 10. |
The equivalences problems for binary EOL-systems are decidable
Fundamentals of computation theory (Proc. Internat. Conf., Poznań-Kórnik, 1977)
, Seite 423--434. Lecture Notes in Comput. Sci., Vol. 56.
1977
|
| 9. |
Valued probabilistic tree functions
Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys.,
24(10):927--930
1976
|
| 8. |
Almost deterministic Ï? -automata with existential output condition
Proc. Amer. Math. Soc.,
53(2):449--452
1975
DOI: 10.2307/2040034
|
| 7. |
Decision algorithms for Havel's branching automata
Mathematical foundations of computer science 1975 (Fourth Sympos., Mariánské Lázne, 1975)
Seite 273--279. Lecture Notes in Comput. Sci., Vol. 32.
1975
|
| 6. |
Free structure tree automata. IV. Sequential representation
Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys.,
22:87--91
1974
|
| 5. |
Probabilistic climbing and sinking languages
Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys.,
22:1057--1061
1974
|
| 4. |
An algorithm for the determination of the optimal structure of a simplex automaton in a sequential adaptive system
Studia Automat.,
1(4):23--33
1973
|
| 3. |
Free structure tree automata. I. Equivalence
Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys.,
21:441--446
1973
|
| 2. |
Free structure tree automata. II. Nondeterministic and deterministic regularity
Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys.,
21:447--450
1973
|