|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 28 van 31 gevonden artikelen
| Titel: |
Star-Connected Flat Languages and Automata |
| Auteur: |
Klunder, Barbara |
| Verschenen in: |
Fundamenta informaticae |
| Paginering: | Jaargang 72 (2006) nr. 1-3 pagina's 235-243 |
| Jaar: |
2006-08-08 |
| Inhoud: |
Star-connected rational expressions were considered only as expressions defining trace languages. In this paper we continue the study of the class of flat languages defined by this kind of rational expressions. We strengthen results of [4] and prove that any star-connected language has an automaton with cycles which are composition of connected cycles. This condition is sufficient for star-connected languages provided that the dependency relation is transitive. As a consequence we obtain for every alphabet stronger pumping lemma for star-connected languages. Finally, the product of two automata inherits this property from the components and thus for alphabet with transitive dependency relation the set of all star-connected languages is closed under intersections. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 28 van 31 gevonden artikelen
| << vorige | volgende >> |