On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs

JIRÁSKOVÁ, Galina and Tomáš MASOPUST. On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs. In N. Moreira and R. Reis. 17th International Conference on Implementation and Application of Automata (CIAA 2012). Berlin: Springer, 2012, p. 229-239. ISSN 0302-9743.

Basic information

Original name

On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs

Authors

JIRÁSKOVÁ, Galina and Tomáš MASOPUST

Edition

Berlin, 17th International Conference on Implementation and Application of Automata (CIAA 2012), p. 229-239, 2012

Publisher

Springer

---

Other information

Language

English

Type of outcome

Proceedings paper

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Czech Republic

Confidentiality degree

is not subject to a state or trade secret

Impact factor

Impact factor: 0.402 in 2005

Organization unit

Faculty of Informatics

ISSN

Tags

International impact, Reviewed