Closure properties of subregular languages under operations

DOI10.1007/978-3-031-13502-6_9MaRDI QIDQ2104140zbMATH OpenOpenAlexFDO

Authors Viktor Olejár, Alexander Szabari

Publication date 9 December 2022

Full work available at URL https://doi.org/10.1007/978-3-031-13502-6_9

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• 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?)
• A Note on Star-Free Events
• Complexity in union-free regular languages
• Determination of finite automata accepting subregular languages
• 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 Theory of Definite Automata
• 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

(6)

• Closure properties of slender languages
• scientific article; zbMATH DE number 3919849 (Why is no real title available?)
• A closure property of regular languages
• On decidability and closure properties of language classes with respect to bio-operations
• Operational complexity in subregular classes
• Closure properties of subclasses of ω-regular languages under morphism and inverse morphism

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)