Principal Ideal Languages and Synchronizing Automata

DOI10.3233/FI-2014-1034zbMath1302.68162arXiv1304.3307OpenAlexW1807511501MaRDI QIDQ2934876

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

Publication date: 22 December 2014

Published in: Fundamenta Informaticae (Search for Journal in Brave)

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

zbMATH Keywords

synchronizing wordstrongly connected automatonsyntactic complexitysynchronizing automatonideal language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

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 ⋮ On the length of uncompletable words in unambiguous automata

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