ON THE ISOMORPHISM CONJECTURE FOR 2-DFA REDUCTIONS

DOI10.1142/S0129054196000245zbMath0867.68059OpenAlexW2074832047WikidataQ123162922 ScholiaQ123162922MaRDI QIDQ3126018

No author found.

Publication date: 23 March 1997

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054196000245

zbMATH Keywords

computational complexity2DFA reductions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

For completeness, sublogarithmic space is no space.

This page was built for publication: ON THE ISOMORPHISM CONJECTURE FOR 2-DFA REDUCTIONS