Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
DLT
/
Paper
Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata.
Petr Jiricka
,
Jaroslav Krl
Venue
C
DLT
Year
1999
Proceedings
Developments in Language Theory
DBLP record
conf/dlt/JirickaK99 ↗
Browse the full
DLT paper archive
.