Roots of Star Events
From MaRDI portal
Cited in
(29)- Algorithms for determining relative star height and star height
- Algorithms for determining relative inclusion star height and inclusion star height
- Properties of code events and homomorphisms over regular events
- A characterization of local regular languages
- The inclusion problem for regular expressions
- Mutually divisible semigroups
- Inverse star, borders, and palstars
- Closure properties of subregular languages under operations
- Operations on subregular languages and nondeterministic state complexity
- Determination of finite automata accepting subregular languages
- Concatenation-free languages
- Factor theory and the unity of opposites
- General properties of star height of regular events
- Star height of certain families of regular events
- Free and almost-free subsemigroups of a free semigroup
- Components and acyclicity of graphs. An exercise in combining precision with concision
- The magic number problem for subregular language families
- Expressive capacity of concatenation freeness
- Nondeterministic state complexity of star-free languages
- Nondeterministic state complexity of star-free languages
- scientific article; zbMATH DE number 3293675 (Why is no real title available?)
- scientific article; zbMATH DE number 3395763 (Why is no real title available?)
- Nondeterministic operational complexity in subregular languages
- Decision problems for subregular classes
- Subregular expressions with two operations
- Closure properties of subregular languages under operations
- Various types of comet languages and their application in external contextual grammars
- Language membership problems for subregular classes
- Closure operations on picture languages and their relation to floor plans
This page was built for publication: Roots of Star Events
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5544298)
