Bideterministic automata and minimal representations of regular languages

Tamm, Hellis; Ukkonen, Esko (2003). Bideterministic automata and minimal representations of regular languages. Implementation and Application of Automata : 8th International Conference, CIAA 2003: Santa Barbara, CA, USA, July 16-18, 2003 Proceedings. Ed. Ibarra,O. H.; Dang,Z. Berlin: Springer, 61−71. (Lecture Notes in Computer Science; 2759).
publitseeritud konverentsiettekanne
Tamm, Hellis; Ukkonen, Esko
  • Inglise
Implementation and Application of Automata : 8th International Conference, CIAA 2003
Ibarra,O. H.; Dang,Z.
Santa Barbara, CA, USA, July 16-18, 2003 Proceedings
Berlin
Springer
0302-9743
3-540-40561-5
Lecture Notes in Computer Science
2759
2003
6171
Ilmunud
1.1. Teadusartiklid, mis on kajastatud Web of Science andmebaasides Science Citation Index Expanded, Social Sciences Citation Index, Arts & Humanities Citation Index ja/või andmebaasis Scopus (v.a. kogumikud)
WOS

Seotud asutused

Lisainfo

bideterministic automata, minimal automata
ISI Web of Science [ISI:000185178700007]