Abstract
In this paper we characterize star-connected languages using finite automata: any language is star-connected if and only if it is accepted by a finite automaton with cycles which are proper composition of connected cycles. Star-connected (flat) languages play an important role in the theory of recognizable languages of monoids with partial commutations. In addition we introduce a flat counterpart of the concurrent star operation used in this theory. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Klunder, B. (2007). Finite automata accepting star-connected languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4783 LNCS, pp. 312–313). Springer Verlag. https://doi.org/10.1007/978-3-540-76336-9_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
