Genetic Algorithm for Synchronization (Q3618622)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Genetic Algorithm for Synchronization	scientific article

Statements

scholarly article

0 references

Genetic Algorithm for Synchronization (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-00982-2_58

0 references

0 references

Language and Automata Theory and Applications

0 references

publication date

2 April 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-00982-2_58

0 references

0 references

0 references

0 references

Synchronization

0 references

Reset Sequences for Monotonic Automata

0 references

Synchronizing finite automata with short reset words

0 references

0 references

0 references

Synchronizing finite automata on Eulerian digraphs.

0 references

Reset words for commutative and solvable automata

0 references

0 references

In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton

0 references

On two Combinatorial Problems Arising from Automata Theory

0 references

The range order of a product of i transformations from a finite full transformation semigroup

0 references

Synchronizing Automata with a Letter of Deficiency 2

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3618622

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