Better Hyper-minimization (Q3073639)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Better Hyper-minimization	scientific article

Statements

scholarly article

0 references

Better Hyper-minimization (English)

0 references

Andreas Maletti

0 references

Implementation and Application of Automata

0 references

publication date

11 February 2011

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-18098-9_22

0 references

Hyper-Minimization in O(n 2)

0 references

HYPER-MINIMIZATION IN O(n<sup>2</sup>)

0 references

Hyper-minimizing minimized deterministic finite state automata

0 references

Hyper-minimisation Made Efficient

0 references

An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton

0 references

An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton

0 references

0 references

Minimal NFA Problems are Hard

0 references

On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-18098-9_22

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3073639

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3073639&oldid=35213721"