2003•Theoretical Computer ScienceOpen access

Converting two-way nondeterministic unary automata into simpler automata

Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini

Open full text 74 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 74 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Unary operation, Nondeterministic algorithm, Deterministic finite automaton, Nondeterministic finite automaton, Automaton, Discrete mathematics, Mathematics, Finite-state machine

Back to paper search Browse research topics Original source

Converting two-way nondeterministic unary automata into simpler automata — Research Paper | ScholarLens