Pages that link to "Item:Q1199879"
From MaRDI portal
The following pages link to Intersection and union of regular languages and state complexity (Q1199879):
Displaying 50 items.
- On CD-systems of stateless deterministic R-automata with window size one (Q439938) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- Rewriting extended regular expressions (Q673635) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- The state complexity of \(L^{2}\) and \(L^k\) (Q844206) (← links)
- State complexity of inversion operations (Q896671) (← links)
- Succinct description of regular languages by weak restarting automata (Q948085) (← links)
- State complexity of power (Q1019718) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- Detecting palindromes, patterns and borders in regular languages (Q1041028) (← links)
- The size of power automata. (Q1401251) (← links)
- On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- Finite transducers and nondeterministic state complexity of regular languages (Q1956627) (← links)
- Power, positive closure, and quotients on convex languages (Q2029485) (← links)
- On the number of active states in finite automata (Q2041683) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- State complexity of partial word finite automata (Q2096588) (← links)
- State complexity of binary coded regular languages (Q2112182) (← links)
- Operations on subregular languages and nondeterministic state complexity (Q2112186) (← links)
- State complexity of finite partial languages (Q2112191) (← links)
- Yet another canonical nondeterministic automaton (Q2112192) (← links)
- Nondeterministic state complexity of site-directed deletion (Q2164749) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- Nondeterministic state complexity of nested word automata (Q2271435) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Language operations with regular expressions of polynomial size (Q2271463) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- A logic for document spanners (Q2322723) (← links)
- Site-directed insertion: language equations and decision problems (Q2334603) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- State complexity of prefix distance (Q2357110) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- On the number of active states in deterministic and nondeterministic finite automata (Q2399248) (← links)
- Nondeterministic complexity of operations on free and convex languages (Q2399254) (← links)
- The state complexity of \(\overline{\varSigma ^*\overline{L}}\) and its connection with temporal logic (Q2423779) (← links)
- Theory of átomata (Q2453119) (← links)
- Descriptional Complexity of Bounded Regular Languages (Q2829978) (← links)
- COMPLEXITY IN UNION-FREE REGULAR LANGUAGES (Q2909101) (← links)
- STATE COMPLEXITY OF CODE OPERATORS (Q2909103) (← links)
- THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES (Q2909186) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods (Q2947420) (← links)
- State Complexity of Prefix Distance (Q2947426) (← links)
