Minimality Notions via Factorization Systems and Examples
For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the system. In the present article, we relate the two minimiz...
Main Author: | Thorsten Wißmann |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2022-09-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/9893/pdf |
Similar Items
-
Minimization of visibly pushdown automata is NP-complete
by: Olivier Gauwin, et al.
Published: (2020-02-01) -
FO2(<,+1,~) on data trees, data tree automata and branching vector addition systems
by: Florent Jacquemard, et al.
Published: (2016-04-01) -
Automata Minimization: a Functorial Approach
by: Thomas Colcombet, et al.
Published: (2020-03-01) -
A Characterization of Morphic Words with Polynomial Growth
by: Tim Smith
Published: (2020-02-01) -
A B\"uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
by: Joost Engelfriet, et al.
Published: (2020-08-01)