BibTeX record journals/eik/BullH90

download as .bib file

@article{DBLP:journals/eik/BullH90,
  author       = {Mathias Bull and
                  Armin Hemmerling},
  title        = {Finite Embedded Trees and Simply Connected Mazes cannot be Searched
                  by Halting Finite Automata},
  journal      = {J. Inf. Process. Cybern.},
  volume       = {26},
  number       = {1/2},
  pages        = {65--73},
  year         = {1990},
  timestamp    = {Fri, 06 Mar 2020 22:02:11 +0100},
  biburl       = {https://dblp.org/rec/journals/eik/BullH90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.