"Finite Embedded Trees and Simply Connected Mazes cannot be Searched by ..."

Mathias Bull, Armin Hemmerling (1990)

> Home

Details and statistics

DOI: —

access: unavailable

type: Journal Article

metadata version: 2020-03-06

- no documents available
- export record
  dblp key:
  - journals/eik/BullH90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eik/BullH90
Mathias Bull, Armin Hemmerling:
Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite Automata. J. Inf. Process. Cybern. 26(1/2): 65-73 (1990)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.