A decision procedure for the order of regular events

DOI10.1016/0304-3975(79)90057-4zbMath0419.68088DBLPjournals/tcs/Hashiguchi79OpenAlexW2088360142WikidataQ63866200 ScholiaQ63866200MaRDI QIDQ1132636

Kosaburo Hashiguchi

Publication date: 1979

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90057-4

zbMATH Keywords

decidabilityiteration of a languagepowers of a languageregular events

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (17)

Rational languages and the Burnside problem ⋮ Exponential upper and lower bounds for the order of a regular language ⋮ Algorithms for determining relative star height and star height ⋮ Some trace monoids where both the Star problem and the Finite Power Property Problem are decidable ⋮ Distance automata having large finite distance or finite ambiguity ⋮ Improved limitedness theorems on finite automata with distance functions ⋮ The product of rational languages ⋮ Algorithms for determining relative inclusion star height and inclusion star height ⋮ Decidability of the star problem in \(A^*\times{}\{ b\}^*\) ⋮ Bounded regular path queries in view-based data integration ⋮ The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets ⋮ New upper bounds to the limitedness of distance automata ⋮ Limitedness theorem on finite automata with distance functions ⋮ Representation theorems on regular languages ⋮ The finite power problem revisited. ⋮ The star problem and the finite power property in trace monoids: Reductions beyond C4 ⋮ Some properties of recognizable \(\mathcal Z\)-subsets

Cites Work

• Unnamed Item

This page was built for publication: A decision procedure for the order of regular events