Closure properties of subregular languages under operations
From MaRDI portal
Publication:2104140
DOI10.1007/978-3-031-13502-6_9OpenAlexW4290017143MaRDI QIDQ2104140
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nondeterministic state complexity of star-free languages
- State complexity of basic operations on suffix-free regular languages
- Quotient complexity of closed languages
- On equations for union-free regular languages
- Quotient complexity of ideal languages
- Power, positive closure, and quotients on convex languages
- Union-freeness, deterministic union-freeness and union-complexity
- Square, power, positive closure, and complementation on star-free languages
- Determination of finite automata accepting subregular languages
- The range of state complexities of languages resulting from the cut operation
- Nondeterministic complexity in subclasses of convex languages
- COMPLEXITY IN UNION-FREE REGULAR LANGUAGES
- Power-separating regular languages
- Operations on Permutation Automata
- Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language
- Ultimate-Definite and Symmetric-Definite Events and Automata
- On finite monoids having only trivial subgroups
- Permutation automata
- The Theory of Definite Automata
- Roots of Star Events
- A Note on Star-Free Events
- The Ranges of Accepting State Complexities of Languages Resulting from Some Operations
This page was built for publication: Closure properties of subregular languages under operations
