Principal Ideal Languages and Synchronizing Automata
From MaRDI portal
Publication:2934876
DOI10.3233/FI-2014-1034zbMATH Open1302.68162arXiv1304.3307OpenAlexW1807511501MaRDI QIDQ2934876FDOQ2934876
Elena Pribavkina, Vladimir V. Gusev, Marina Maslennikova
Publication date: 22 December 2014
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Abstract: We study ideal languages generated by a single word. We provide an algorithm to construct a strongly connected synchronizing automaton for which such a language serves as the language of synchronizing words. Also we present a compact formula to calculate the syntactic complexity of this language.
Full work available at URL: https://arxiv.org/abs/1304.3307
synchronizing wordstrongly connected automatonsyntactic complexitysynchronizing automatonideal language
Cited In (5)
- On the length of uncompletable words in unambiguous automata
- Strongly connected synchronizing automata and the language of minimal reset words
- Ideal regular languages and strongly connected synchronizing automata
- Trim Strongly Connected Synchronizing Automata and Ideal Languages
- Representation of (Left) Ideal Regular Languages by Synchronizing Automata
This page was built for publication: Principal Ideal Languages and Synchronizing Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934876)
