Work

Shortest Accepted Strings for Two-Way Finite Automata: Approaching the $$2^n$$ Lower Bound

Year: 2023

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-031-34326-1_10

Authors: Olga Martynova, Alexander Okhotin

Institution: St Petersburg University

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W4381855978

FWCI: 0.44

Cites: 10

Cited by: 1

Related to: 10