scientific article; zbMATH DE number 2086619
From MaRDI portal
Publication:4737154
Recommendations
- scientific article; zbMATH DE number 1688391
- On theory of regular languages with the Kleene star operation
- Regular languages of star height one
- State complexity of union and intersection of star on \(k\) regular languages
- scientific article; zbMATH DE number 1534571
- Intersection and union of regular languages and state complexity
- APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES
- Publication:4936686
- scientific article; zbMATH DE number 2080228
- Star-connected flat languages and automata
Cited in
(17)- A characterization of rational star languages generated by strong codes
- The infinite 2-star height hierarchy of extended regular languages of star degree at most two
- Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy
- Binary intersection revisited
- Binary intersection formalized
- scientific article; zbMATH DE number 1688391 (Why is no real title available?)
- Regular expression star-freeness is PSPACE-complete
- Regular languages of star height one
- On the complexity of intersecting regular, context-free, and tree languages
- The complexity of intersecting finite automata having few final states
- Characterization of Star-Connected Languages Using Finite Automata
- scientific article; zbMATH DE number 2086412 (Why is no real title available?)
- The emptiness problem for intersections of regular languages
- APPROXIMATING DEPENDENCY GRAMMARS THROUGH INTERSECTION OF STAR-FREE REGULAR LANGUAGES
- The language intersection problem for non-recursive context-free grammars
- On the complexity of intersection non-emptiness for star-free language classes
- Incremental algorithms for solving regular expression intersection non-emptiness
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737154)
