Descriptional complexity of the forever operator
From MaRDI portal
Recommendations
Cites work
- A lower bound technique for the size of nondeterministic finite automata
- A survey on operational state complexity
- Complexity in union-free regular languages
- Constructions for alternating finite automata∗
- Descriptional Complexity of Operations on Alternating and Boolean Automata
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3269886 (Why is no real title available?)
- scientific article; zbMATH DE number 3305062 (Why is no real title available?)
- scientific article; zbMATH DE number 3353192 (Why is no real title available?)
- Intersection and union of regular languages and state complexity
- Mathematical Foundations of Computer Science 2005
- On Dedekind's Problem: The Number of Isotone Boolean Functions. II
- On equations for regular languages, finite automata, and sequential networks
- On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
- On the expressive power of temporal logic
- On the State Complexity of the Shuffle of Regular Languages
- Optimal simulation of self-verifying automata by deterministic automata
- The state complexities of some basic operations on regular languages
- The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic
This page was built for publication: Descriptional complexity of the forever operator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5384434)
