Co-determinism and unambiguity of automata accepting finite or infinite words.

Published in Volume XIV, 2004, pages 1-11

Authors: Stefan ANDREI, Wei-Ngan CHIN, Gheorghe GRIGORAS

Abstract

Automata theory plays an important role in the verification
of finite-state systems. The deterministic automata are the
most prefered ones since the inclusion problem is decidable.
Similar to deterministic automata, it is worthwhile to
consider two other important classes for finite and infinite words,
such as: co-deterministic
automata and unambiguous automata. This paper describes related
subclasses of these automata, by comparison with existing terminology.

Bibtex

@article{sacscuza:andrei2004cauoaafoiw,
  title={Co-determinism and unambiguity of automata accepting finite or infinite words.},
  author={Stefan ANDREI and Wei-Ngan CHIN and Gheorghe GRIGORAS},
  journal={Scientific Annals of Computer Science},
  volume={14},
  organization={``A.I. Cuza'' University, Iasi, Romania},
  year={2004},
  pages={1--11},
  publisher={``A.I. Cuza'' University Press}
}