Pages that link to "Item:Q759489"
From MaRDI portal
The following pages link to On regularity of context-free languages (Q759489):
Displaying 50 items.
- Number of holes in unavoidable sets of partial words. I. (Q450546) (← links)
- A characterization of (regular) circular languages generated by monotone complete splicing systems (Q606981) (← links)
- Well quasi-orders and context-free grammars (Q703570) (← links)
- Unavoidable sets and circular splicing languages (Q728277) (← links)
- Unavoidable sets of partial words (Q733729) (← links)
- Insertion languages (Q796994) (← links)
- Well quasi-orders generated by a word-shuffle rewriting (Q884464) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- A regularity test for dual bordered OS systems (Q1060851) (← links)
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\) (Q1069312) (← links)
- Rational languages and the Burnside problem (Q1079380) (← links)
- On total regulators generated by derivation relations (Q1084874) (← links)
- Termination of rewriting (Q1098624) (← links)
- Using unavoidable set of trees to generalize Kruskal's theorem (Q1122597) (← links)
- Inventories of unavoidable languages and the word-extension conjecture (Q1129010) (← links)
- On the regularity of languages on a binary alphabet generated by copying systems (Q1205714) (← links)
- On quasi orders of words and the confluence property (Q1276254) (← links)
- Well quasi-orders and regular languages (Q1338899) (← links)
- Well-quasi-orders and regular \(\omega\)-languages (Q1882913) (← links)
- On the rational subsets of the free group (Q1924996) (← links)
- Finite language forbidding-enforcing systems (Q2011661) (← links)
- Language equations (Q2074222) (← links)
- Commutative regular languages with product-form minimal automata (Q2096583) (← links)
- Regularity conditions for iterated shuffle on commutative regular languages (Q2117658) (← links)
- Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages (Q2163995) (← links)
- Well quasi-orders arising from finite ordered semigroups (Q2163999) (← links)
- Hybrid and generalized marked systems (Q2243582) (← links)
- Rational subsets and submonoids of wreath products. (Q2347806) (← links)
- On the expressivity of time-varying graphs (Q2348032) (← links)
- Characterization and complexity results on jumping finite automata (Q2357104) (← links)
- On square-increasing ordered monoids and idempotent semirings (Q2362745) (← links)
- The size of Higman-Haines sets (Q2465049) (← links)
- Regular solutions of language inequalities and well quasi-orders (Q2581271) (← links)
- Two Results on Discontinuous Input Processing (Q2829983) (← links)
- Jumping Finite Automata: Characterizations and Complexity (Q2947412) (← links)
- Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three (Q3000493) (← links)
- Well-Quasi Orders and Hierarchy Theory (Q3295154) (← links)
- Injective envelopes of transition systems and Ferrers languages (Q3298124) (← links)
- Well quasi-orders, unavoidable sets, and derivation systems (Q3421904) (← links)
- On the degree of non-regularity of context-free languages (Q3479526) (← links)
- Well Quasi-orders in Formal Language Theory (Q3533001) (← links)
- Generalized cancellation-and-permutation properties, regular languages and supports of rational series (Q3815540) (← links)
- Two complexity measures for context-free languages (Q3821606) (← links)
- On Basic Properties of Jumping Finite Automata (Q4639928) (← links)
- Unavoidable Set: Extension and Reduction (Q4718891) (← links)
- Unavoidable languages, cuts and innocent sets of words (Q4858836) (← links)
- Embedding with patterns and associated recursive path ordering (Q5055733) (← links)
- (Q5061518) (← links)
- Semigroups satisfying x m+n = x n (Q5881194) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
