Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICALP
/
Paper
Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata.
Janis Kaneps
,
Rusins Freivalds
Venue
A*
ICALP
Year
1991
Proceedings
ICALP
DBLP record
conf/icalp/KanepsF91 ↗
Browse the full
ICALP paper archive
.