The Dual DFA Learning Problem: Hardness Results for Programming by Demonstration and Learning First-Order Representations (Extended Abstract)

Cite

Text

Cohen. "The Dual DFA Learning Problem: Hardness Results for Programming by Demonstration and Learning First-Order Representations (Extended Abstract)." Annual Conference on Computational Learning Theory, 1996. doi:10.1145/238061.238066

Markdown

[Cohen. "The Dual DFA Learning Problem: Hardness Results for Programming by Demonstration and Learning First-Order Representations (Extended Abstract)." Annual Conference on Computational Learning Theory, 1996.](https://mlanthology.org/colt/1996/cohen1996colt-dual/) doi:10.1145/238061.238066

BibTeX

@inproceedings{cohen1996colt-dual,
  title     = {{The Dual DFA Learning Problem: Hardness Results for Programming by Demonstration and Learning First-Order Representations (Extended Abstract)}},
  author    = {Cohen, William W.},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1996},
  pages     = {29-40},
  doi       = {10.1145/238061.238066},
  url       = {https://mlanthology.org/colt/1996/cohen1996colt-dual/}
}