On regularity of context-free languages

commutativity context-free language regular languages rewriting system semi-Thue system isertion language iterative pair linear language periodic languages pure squares subword complete unitary grammar well-quasi orders

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

Cited In (76)

Title not available (Why is that?)
Title not available (Why is that?)
Characterization of ordered semigroups generating well quasi-orders of words
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
INTERLEAVING LOGIC AND COUNTING
Finite embeddability property for residuated lattices via regular languages
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
Unavoidable Set: Extension and Reduction
Title not available (Why is that?)
Language inclusion algorithms as complete abstract interpretations
Title not available (Why is that?)
On the Density of Regular and Context-Free Languages
Well quasi-orders, unavoidable sets, and derivation systems
On the expressivity of time-varying graphs
On the rational subsets of the free group
On the degree of non-regularity of context-free languages
Rational languages and the Burnside problem
Insertion languages
On an extension of the class of context-free languages
On total regulators generated by derivation relations
Regularity conditions for iterated shuffle on commutative regular languages
Kleene Closure on Regular and Prefix-Free Languages
Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
Finite language forbidding-enforcing systems
Rational subsets and submonoids of wreath products.
Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
Well Quasi-orders in Formal Language Theory
Unavoidable languages, cuts and innocent sets of words
On the regularity of languages on a binary alphabet generated by copying systems
Jumping Finite Automata: Characterizations and Complexity
On quasi orders of words and the confluence property
Well quasi-orders and regular languages
Title not available (Why is that?)
Hybrid and generalized marked systems
Regular Realizability Problems and Context-Free Languages
Injective envelopes of transition systems and Ferrers languages
Title not available (Why is that?)
Generalized cancellation-and-permutation properties, regular languages and supports of rational series
Number of holes in unavoidable sets of partial words. I.
On square-increasing ordered monoids and idempotent semirings
Termination of rewriting
Well quasi-orders and context-free grammars
Unavoidable sets of partial words
Two Results on Discontinuous Input Processing
Well quasi-orders generated by a word-shuffle rewriting
Well-quasi-orders and regular \(\omega\)-languages
The size of Higman-Haines sets
Testing avoidability on sets of partial words is hard
Two complexity measures for context-free languages
Well quasi-orders arising from finite ordered semigroups
Inventories of unavoidable languages and the word-extension conjecture
Using unavoidable set of trees to generalize Kruskal's theorem
On Basic Properties of Jumping Finite Automata
Embedding with patterns and associated recursive path ordering
On the commutative equivalence of bounded context-free and regular languages: the code case
Regular and Context-Free Pattern Languages over Small Alphabets
Title not available (Why is that?)
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
Language equations
A characterization of (regular) circular languages generated by monotone complete splicing systems
Characterization and complexity results on jumping finite automata
On the context-free production complexity of finite languages
Title not available (Why is that?)
A regularity test for dual bordered OS systems
Finite turns and the regular closure of linear context-free languages
Well-Quasi Orders and Hierarchy Theory
Title not available (Why is that?)
Unavoidable sets and circular splicing languages
Classes of regular and context-free languages over countably infinite alphabets
Regular solutions of language inequalities and well quasi-orders
Semigroups satisfying x m+n = x n
Commutative regular languages with product-form minimal automata
Concerning two-adjacent context-free languages
Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three

   Recommendations

On the commutative equivalence of context-free languages 👍 👎
Well-quasi-orders and regular \(\omega\)-languages 👍 👎
Title not available (Why is that?) 👍 👎
Well quasi-orders and context-free grammars 👍 👎
Well quasi-orders and regular languages 👍 👎

This page was built for publication: On regularity of context-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q759489)