Pages that link to "Item:Q3549457"
From MaRDI portal
The following pages link to A Second Course in Formal Languages and Automata Theory (Q3549457):
Displayed 50 items.
- Periodicity in rectangular arrays (Q344541) (← links)
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- Number of holes in unavoidable sets of partial words. II. (Q450549) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Nondeterministic automatic complexity of overlap-free and almost square-free words (Q490407) (← links)
- Profinite automata (Q504425) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- On the joint subword complexity of automatic sequences (Q837149) (← links)
- Outfix-guided insertion (Q1682857) (← links)
- Reducing complex CSP models to traces via priority (Q1744391) (← links)
- Pseudo-inversion: closure properties and decidability (Q2003444) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- Union-complexities of Kleene plus operation (Q2112193) (← links)
- Operational union-complexity (Q2113386) (← links)
- Translating between models of concurrency (Q2182666) (← links)
- Lengths of words accepted by nondeterministic finite automata (Q2203588) (← links)
- Unique decipherability in formal languages (Q2283038) (← links)
- Site-directed insertion: language equations and decision problems (Q2334603) (← links)
- A formalisation of the Myhill-Nerode theorem based on regular expressions (Q2351151) (← links)
- State complexity of prefix distance (Q2357110) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- Automatic sequences and curves over finite fields (Q2397618) (← links)
- On the Language of Primitive Partial Words (Q2799195) (← links)
- Outfix-Guided Insertion (Q2817379) (← links)
- State Complexity of Prefix Distance of Subregular Languages (Q2829982) (← links)
- Prefix Distance Between Regular Languages (Q2830223) (← links)
- Undecidability of state complexity (Q2855756) (← links)
- State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
- Duplications and Pseudo-Duplications (Q2945563) (← links)
- From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods (Q2947420) (← links)
- State Complexity of Prefix Distance (Q2947426) (← links)
- Matrix Semigroup Freeness Problems in SL $$(2,\mathbb {Z})$$ (Q2971140) (← links)
- Vector Ambiguity and Freeness Problems in SL $$(2,\mathbb {Z})$$ (Q2988836) (← links)
- On Language Decompositions and Primality (Q3003471) (← links)
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Factorization in Formal Languages (Q3451092) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q3451118) (← links)
- FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME (Q3586406) (← links)
- General Framework (Q4613545) (← links)
- State Complexity of Neighbourhoods and Approximate Pattern Matching (Q4640043) (← links)
- (Q4644335) (← links)
- Descriptional Complexity of Error Detection (Q4686648) (← links)
- DIGIT SUMS AND VERTEX-LABELINGS (Q4973407) (← links)
- The State Complexity of Lexicographically Smallest Words and Computing Successors (Q5041251) (← links)
- (Q5061525) (← links)
- (Q5089309) (← links)
- (Q5094137) (← links)