Bideterministic automata and minimal representations of regular languages

Tamm, Hellis; Ukkonen, Esko (2004). Bideterministic automata and minimal representations of regular languages. Theoretical Computer Science, 328, 135−149.10.1016/j.tcs.2004.07.010.
ajakirjaartikkel
Tamm, Hellis; Ukkonen, Esko
  • Inglise
Theoretical Computer Science
328
2004
135149
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

Viited terviktekstile

dx.doi.org/10.1016/j.tcs.2004.07.010

Lisainfo

bideterministic automata, minimal automata
ACM Computing Reviews; CompuScience; Computer Abstracts; Current Contents/Engineering, Computing and