State Complexity of Union and Intersection of Finite Languages
From MaRDI portal
Recommendations
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
- Intersection and union of regular languages and state complexity
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
- On state complexity of finite word and tree languages
- On the state complexity of star of union and star of intersection
Cited in
(16)- Intersection and union of regular languages and state complexity
- On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\)
- State complexity of union and intersection on graph-walking automata
- Commutative regular languages -- properties and state complexity
- State-complexity hierarchies of uniform languages of alphabet-size length
- Time window temporal logic
- State complexity of k-union and k-intersection for prefix-free regular languages
- On the state complexity of star of union and star of intersection
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata
- On state complexity of finite word and tree languages
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
- State complexity of union and intersection of star on \(k\) regular languages
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages
- scientific article; zbMATH DE number 2201371 (Why is no real title available?)
- The state complexity of permutations on finite languages over binary alphabets
This page was built for publication: State Complexity of Union and Intersection of Finite Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428233)
