Closure properties of subregular languages under operations
From MaRDI portal
Publication:2104140
DOI10.1007/978-3-031-13502-6_9OpenAlexW4290017143MaRDI QIDQ2104140FDOQ2104140
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- Quotient complexity of bifix-, factor-, and subword-free regular languages
- Operational state complexity of prefix-free regular languages
- State complexity of basic operations on suffix-free regular languages
- Square, power, positive closure, and complementation on star-free languages
- Determination of finite automata accepting subregular languages
- Complexity in union-free regular languages
- Title not available (Why is that?)
- Nondeterministic state complexity of star-free languages
- Power-separating regular languages
- Roots of Star Events
- Permutation automata
- Languages convex with respect to binary relations, and their closure properties
- Ultimate-Definite and Symmetric-Definite Events and Automata
- The Theory of Definite Automata
- Title not available (Why is that?)
- A Note on Star-Free Events
- Quotient complexity of ideal languages
- The range of state complexities of languages resulting from the cut operation
- Operations on Permutation Automata
- On equations for union-free regular languages
- Nondeterministic complexity in subclasses of convex languages
- Power, positive closure, and quotients on convex languages
- Union-freeness, deterministic union-freeness and union-complexity
- The ranges of accepting state complexities of languages resulting from some operations
Cited In (6)
- Closure properties of slender languages
- Title not available (Why is that?)
- On decidability and closure properties of language classes with respect to bio-operations
- A closure property of regular languages
- 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)
