Characterization of Star-Connected Languages Using Finite Automata

Authors:
Barbara Klunder
Affiliations:
Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Toruń, Poland
Venue:
Language and Automata Theory and Applications
Year:
2008

Citing 5
Cited 0

Semi-commutations

Information and Computation
The Book of Traces

The Book of Traces
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
On Star-Connected Flat Languages

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Star-Connected Flat Languages and Automata

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005

Quantified Score

Hi-index	0.00

Visualization

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 compositions 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 concurrent star operation used in the theory of recognizable languages.