Finitely Generated Ideal Languages and Synchronizing Automata

DOI10.1007/978-3-642-40579-2_16zbMath1398.68310arXiv1305.0336OpenAlexW1518348448MaRDI QIDQ2849984

Marina Maslennikova, Elena V. Pribavkina, Vladimir V. Gusev

Publication date: 20 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.0336

zbMATH Keywords

synchronizing wordsynchronizing automatonideal languagereset complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Strongly connected synchronizing automata and the language of minimal reset words ⋮ Ideal regular languages and strongly connected synchronizing automata ⋮ Representation of (Left) Ideal Regular Languages by Synchronizing Automata ⋮ Groups and semigroups defined by colorings of synchronizing automata ⋮ Reset complexity and completely reachable automata with simple idempotents

This page was built for publication: Finitely Generated Ideal Languages and Synchronizing Automata