Closure properties of subregular languages under operations
From MaRDI portal
Publication:2104140
Cites work
- A Note on Star-Free Events
- Complexity in union-free regular languages
- Determination of finite automata accepting subregular languages
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3473324 (Why is no real title available?)
- scientific article; zbMATH DE number 3416974 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- Languages convex with respect to binary relations, and their closure properties
- Nondeterministic complexity in subclasses of convex languages
- Nondeterministic state complexity of star-free languages
- On equations for union-free regular languages
- On finite monoids having only trivial subgroups
- Operational state complexity of prefix-free regular languages
- Operations on Permutation Automata
- Permutation automata
- Power, positive closure, and quotients on convex languages
- Power-separating regular languages
- Quotient complexity of bifix-, factor-, and subword-free regular languages
- Quotient complexity of ideal languages
- Roots of Star Events
- Square, power, positive closure, and complementation on star-free languages
- State complexity of basic operations on suffix-free regular languages
- The range of state complexities of languages resulting from the cut operation
- The ranges of accepting state complexities of languages resulting from some operations
- The Theory of Definite Automata
- Ultimate-Definite and Symmetric-Definite Events and Automata
- Union-freeness, deterministic union-freeness and union-complexity
Cited in
(8)- A closure property of regular languages
- Closure properties of slender languages
- On decidability and closure properties of language classes with respect to bio-operations
- scientific article; zbMATH DE number 3919849 (Why is no real title available?)
- Closure properties of subclasses of ω-regular languages under morphism and inverse morphism
- Operational complexity in subregular classes
- Operational complexity in subregular classes
- Closure properties of subregular languages under operations
This page was built for publication: Closure properties of subregular languages under operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104140)
