Closure properties of subregular languages under operations

DOI10.1142/S0129054123450016MaRDI QIDQ6902484zbMATH OpenFDO

Authors Viktor Olejár, Alexander Szabari

Publication date 11 November 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054123450016

zbMATH Keywords

regular languagesclosure propertiesregular language subclasses

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• 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 3368555 (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?)
• A Note on Star-Free Events
• A survey on computationally complete accepting and generating networks of evolutionary processors
• Characterizations of locally testable events
• Closure properties of subregular languages under operations
• Complexity in union-free regular languages
• Determination of finite automata accepting subregular languages
• Languages convex with respect to binary relations, and their closure properties
• Lower Bound of the Number of Threshold Functions
• Minimal reversible deterministic finite automata
• 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 closed 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 Theory of Definite Automata
• The dot-depth hierarchy, 45 years later
• The range of state complexities of languages resulting from the cut operation
• The ranges of accepting state complexities of languages resulting from some operations
• Ultimate-Definite and Symmetric-Definite Events and Automata
• Union-freeness, deterministic union-freeness and union-complexity

Cited in

(1)

• Various types of comet languages and their application in external contextual grammars

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 Q6902484)