Classification of noncounting events
From MaRDI portal
Publication:2553949
DOI10.1016/S0022-0000(71)80006-5zbMath0241.94050OpenAlexW2043194137MaRDI QIDQ2553949
A. Gabrielian, Karel II Culik, Janusz A. Brzozowski
Publication date: 1971
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(71)80006-5
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (22)
Semigroups satisfying x m+n = x n ⋮ Rational languages and the Burnside problem ⋮ LOCAL GROUPS IN FREE GROUPOIDS SATISFYING CERTAIN MONOID IDENTITIES ⋮ An efficient algorithm for online square detection ⋮ Concatenation hierarchies: new bottle, old wine ⋮ The origins of combinatorics on words ⋮ Left-noncounting languages ⋮ Cancellation in semigroups in which \(x^ 2=x^ 3\) ⋮ On the subword complexity of square-free DOL languages ⋮ Finiteness and iteration conditions for semigroups ⋮ Tribute: The influence of Imre Simon's work in the theory of automata, languages and semigroups ⋮ On noncounting regular classes ⋮ Some results on the dot-depth hierarchy ⋮ Infinite iteration of matrix semigroups. II: Structure theorem for arbitrary semigroups up to aperiodic morphism ⋮ The dot-depth hierarchy of star-free languages is infinite ⋮ Sur le produit de concatenation non ambigu ⋮ A strongly primitive word of arbitrary length and its application † ⋮ MEMBERSHIP AND FINITENESS PROBLEMS FOR RATIONAL SETS OF REGULAR LANGUAGES ⋮ Obituary: Aldo de Luca 1941--2018 ⋮ A language theoretic interpretation of the Schützenberger representations with applications to certain varieties of languages ⋮ Characterizing level one in group-based concatenation hierarchies ⋮ Free Burnside Semigroups
Cites Work
This page was built for publication: Classification of noncounting events
