scientific article; zbMATH DE number 2053215
From MaRDI portal
Publication:4454842
Recommendations
Cited in
(13)- ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON
- Representation of a class of nondeterministic semiautomata by canonical words.
- Generalized canonical automata and factor automata
- A Succinct Canonical Register Automaton Model
- NFA reduction algorithms by means of regular inequalities
- Reduction of fuzzy automata by means of fuzzy quasi-orders
- Fuzzy relation equations and reduction of fuzzy automata
- Canonical copresentation of automata.
- Canonical nondeterministic automata
- A succinct canonical register automaton model
- Canonical automata via distributive law homomorphisms
- Coalgebraic constructions of canonical nondeterministic automata
- Graph spectral properties of deterministic finite automata (short paper)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4454842)