Pages that link to "Item:Q2829964"
From MaRDI portal
The following pages link to Descriptional Complexity of Formal Systems (Q2829964):
Displaying 50 items.
- On the complexity and decidability of some problems involving shuffle (Q1706154) (← links)
- Transducer descriptions of DNA code properties and undecidability of antimorphic problems (Q1706156) (← links)
- Completely Reachable Automata (Q2829965) (← links)
- Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems (Q2829966) (← links)
- Self-Verifying Finite Automata and Descriptional Complexity (Q2829967) (← links)
- On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection (Q2829969) (← links)
- Unrestricted State Complexity of Binary Operations on Regular Languages (Q2829970) (← links)
- On the State Complexity of the Shuffle of Regular Languages (Q2829972) (← links)
- MSO-definable Properties of Muller Context-Free Languages Are Decidable (Q2829973) (← links)
- Contextual Array Grammars with Matrix and Regular Control (Q2829974) (← links)
- Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems (Q2829975) (← links)
- Operations on Weakly Recognizing Morphisms (Q2829976) (← links)
- Descriptional Complexity of Bounded Regular Languages (Q2829978) (← links)
- The Complexity of Languages Resulting from the Concatenation Operation (Q2829979) (← links)
- Minimal and Reduced Reversible Automata (Q2829980) (← links)
- Unary Self-verifying Symmetric Difference Automata (Q2829981) (← links)
- State Complexity of Prefix Distance of Subregular Languages (Q2829982) (← links)
- Two Results on Discontinuous Input Processing (Q2829983) (← links)
- Blum Static Complexity and Encoding Spaces (Q2843080) (← links)
- Invertible Transductions and Iteration (Q2843081) (← links)
- Universal Witnesses for State Complexity of Boolean Operations and Concatenation Combined with Star (Q2843082) (← links)
- Searching for Traces of Communication in Szilard Languages of Parallel Communicating Grammar Systems - Complexity Views (Q2843083) (← links)
- State Complexity of Basic Operations on Non-returning Regular Languages (Q2843084) (← links)
- State Complexity of Subtree-Free Regular Tree Languages (Q2843085) (← links)
- State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages (Q2843086) (← links)
- A Direct Construction of Finite State Automata for Pushdown Store Languages (Q2843087) (← links)
- Nondeterministic State Complexity of Proportional Removals (Q2843088) (← links)
- Nondeterministic Biautomata and Their Descriptional Complexity (Q2843089) (← links)
- Queue Automata of Constant Length (Q2843090) (← links)
- On the State Complexity of the Reverse of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages (Q2843091) (← links)
- Size of Unary One-Way Multi-head Finite Automata (Q2843092) (← links)
- Syntactic Complexity of ${\mathcal R}$ - and ${\mathcal J}$ -Trivial Regular Languages (Q2843093) (← links)
- Sophistication as Randomness Deficiency (Q2843094) (← links)
- Shortest Repetition-Free Words Accepted by Automata (Q2843095) (← links)
- A Characterisation of NL/poly via Nondeterministic Finite Automata (Q2843096) (← links)
- Improved Normal Form for Grammars with One-Sided Contexts (Q2843097) (← links)
- Comparisons between Measures of Nondeterminism on Finite Automata (Q2843098) (← links)
- Finite Nondeterminism vs. DFAs with Multiple Initial States (Q2843099) (← links)
- The Power of Centralized PC Systems of Pushdown Automata (Q2843100) (← links)
- Limited Automata and Regular Languages (Q2843101) (← links)
- Reversal on Regular Languages and Descriptional Complexity (Q2843102) (← links)
- Kleene Star on Unary Regular Languages (Q2843104) (← links)
- Computing with Capsules (Q3167568) (← links)
- Minicomplexity (Q3167569) (← links)
- Logical Analysis of Hybrid Systems (Q3167570) (← links)
- Groups and Automata: A Perfect Match (Q3167571) (← links)
- Uniform Distributed Pushdown Automata Systems (Q3167572) (← links)
- Removing Nondeterminism in Constant Height Pushdown Automata (Q3167573) (← links)
- On Inverse Operations and Their Descriptional Complexity (Q3167574) (← links)
- Deciding Representability of Sets of Words of Equal Length (Q3167575) (← links)
