On the equivalence of stationary and finite-nonstationary nondeterministic automata

DOI10.3103/S1063454107040103zbMATH Open1203.68087OpenAlexW2059979350MaRDI QIDQ946032

J.-B. Mbaitar

Publication date: 22 September 2008

Published in: Vestnik St. Petersburg University. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1063454107040103

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)

Related Items (2)

On Equivalence Checking of Nondeterministic Finite Automata ⋮ Finitely nonstationary nondeterministic automata with random input

This page was built for publication: On the equivalence of stationary and finite-nonstationary nondeterministic automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q946032)