scientific article
From MaRDI portal
Publication:4036599
zbMath0766.68063MaRDI QIDQ4036599
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decision problemsminimizationlimited nondeterminismdeterministic finite automatonnondeterministic finite automatoncomputationally hardoptimal-conversion problems
Related Items (7)
Using SAT solvers for synchronization issues in non-deterministic automata ⋮ An approximation algorithm for state minimization in 2-MDFAs ⋮ The intersection problem for finite monoids ⋮ A note on the space complexity of some decision problems for finite automata ⋮ Büchi Automata Can Have Smaller Quotients ⋮ Unnamed Item ⋮ The state complexities of some basic operations on regular languages
This page was built for publication: