Pages that link to "Item:Q3021944"
From MaRDI portal
The following pages link to UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION (Q3021944):
Displaying 50 items.
- Closure properties and descriptional complexity of deterministic regular expressions (Q265078) (← links)
- State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
- State complexity of combined operations for suffix-free regular languages (Q392179) (← links)
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- State complexity of combined operations with two basic operations (Q441851) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
- The state complexity of \(L^{2}\) and \(L^k\) (Q844206) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- State complexity of power (Q1019718) (← links)
- Decimations of languages and state complexity (Q1019721) (← links)
- State complexity of basic operations on suffix-free regular languages (Q1029324) (← links)
- Quotient complexity of closed languages (Q1678754) (← links)
- Descriptional complexity of limited automata (Q1706157) (← links)
- On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- Complementing unary nondeterministic automata (Q1763723) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- Power, positive closure, and quotients on convex languages (Q2029485) (← links)
- New methods to find patches of invisible integer lattice points (Q2037281) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Commutative regular languages with product-form minimal automata (Q2096583) (← links)
- State complexity investigations on commutative languages -- the upward and downward closure, commutative aperiodic and commutative group languages (Q2096584) (← links)
- State complexity of GF(2)-operations on unary languages (Q2113387) (← links)
- Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages (Q2163995) (← links)
- Usefulness of information and unary languages (Q2232271) (← links)
- Estimation of state complexity of combined operations (Q2271462) (← links)
- State complexity of unambiguous operations on finite automata (Q2334604) (← links)
- State complexity of combined operations (Q2383591) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- Descriptional Complexity of Bounded Regular Languages (Q2829978) (← links)
- Undecidability of state complexity (Q2855756) (← links)
- STATE COMPLEXITY OF CODE OPERATORS (Q2909103) (← links)
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-STAR AND CATENATION-REVERSAL (Q2909180) (← links)
- State Complexity of Insertion (Q2970209) (← links)
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION (Q3224949) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- State Complexity of Boundary of Prefix-Free Regular Languages (Q3455750) (← links)
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION (Q3503086) (← links)
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES (Q3538851) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- State Complexity of Combined Operations for Prefix-Free Regular Languages (Q3618598) (← links)
- Lattice Point Visibility on Generalized Lines of Sight (Q4577959) (← links)
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES (Q4923279) (← links)
