On regularity of context-free languages
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3677223 (Why is no real title available?)
- scientific article; zbMATH DE number 3780588 (Why is no real title available?)
- scientific article; zbMATH DE number 3634526 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- scientific article; zbMATH DE number 3323852 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- scientific article; zbMATH DE number 3198033 (Why is no real title available?)
- Cônes rationnels commutatifs
- Insertion languages
- Linear Automaton Transformations
- Monadic Thue systems
- On basic properties of DOS systems and languages
- On free monoids partially ordered by embedding
- Ordering by Divisibility in Abstract Algebras
- Recursive unsolvability of a problem of Thue
- Scattered context grammars
- The theory of well-quasi-ordering: a frequently discovered concept
- Une généralisation des ensembles de Dyck
- Well-quasi-orderings and sets of finite sequences
Cited in
(77)- On the unavoidability of primitive words and other languages
- scientific article; zbMATH DE number 2051170 (Why is no real title available?)
- On the Density of Regular and Context-Free Languages
- scientific article; zbMATH DE number 2013205 (Why is no real title available?)
- Characterization of ordered semigroups generating well quasi-orders of words
- Finite embeddability property for residuated lattices via regular languages
- scientific article; zbMATH DE number 7561705 (Why is no real title available?)
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- scientific article; zbMATH DE number 5251101 (Why is no real title available?)
- Language inclusion algorithms as complete abstract interpretations
- INTERLEAVING LOGIC AND COUNTING
- scientific article; zbMATH DE number 1822166 (Why is no real title available?)
- Unavoidable Set: Extension and Reduction
- scientific article; zbMATH DE number 2102747 (Why is no real title available?)
- Well quasi-orders, unavoidable sets, and derivation systems
- Commutative regular languages with product-form minimal automata
- Injective envelopes of transition systems and Ferrers languages
- Concerning two-adjacent context-free languages
- A regularity test for dual bordered OS systems
- Well quasi-orders and regular languages
- Using unavoidable set of trees to generalize Kruskal's theorem
- scientific article; zbMATH DE number 5205535 (Why is no real title available?)
- Unavoidable languages, cuts and innocent sets of words
- Finite turns and the regular closure of linear context-free languages
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
- Well quasi-orders arising from finite ordered semigroups
- Well quasi-orders generated by a word-shuffle rewriting
- On the rational subsets of the free group
- Classes of regular and context-free languages over countably infinite alphabets
- The size of Higman-Haines sets
- Regularity conditions for iterated shuffle on commutative regular languages
- Regular and Context-Free Pattern Languages over Small Alphabets
- On the regularity of languages on a binary alphabet generated by copying systems
- scientific article; zbMATH DE number 2040909 (Why is no real title available?)
- Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
- Every commutative quasirational language is regular
- Well-quasi-orders and regular \(\omega\)-languages
- Well quasi-orders and context-free grammars
- Embedding with patterns and associated recursive path ordering
- Regular solutions of language inequalities and well quasi-orders
- Hybrid and generalized marked systems
- On the degree of non-regularity of context-free languages
- Semigroups satisfying x m+n = x n
- Rational languages and the Burnside problem
- Jumping finite automata: characterizations and complexity
- On the context-free production complexity of finite languages
- Language equations
- Kleene Closure on Regular and Prefix-Free Languages
- On square-increasing ordered monoids and idempotent semirings
- Insertion languages
- State complexity bounds for the commutative closure of group languages
- Regular Realizability Problems and Context-Free Languages
- Inventories of unavoidable languages and the word-extension conjecture
- Minimum number of holes in unavoidable sets of partial words of size three
- Two results on discontinuous input processing
- Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
- Testing avoidability on sets of partial words is hard
- Well-Quasi Orders and Hierarchy Theory
- On an extension of the class of context-free languages
- A characterization of (regular) circular languages generated by monotone complete splicing systems
- On quasi orders of words and the confluence property
- On the expressivity of time-varying graphs
- scientific article; zbMATH DE number 611232 (Why is no real title available?)
- Two complexity measures for context-free languages
- On basic properties of jumping finite automata
- Well Quasi-orders in Formal Language Theory
- Unavoidable sets of partial words
- Characterization and complexity results on jumping finite automata
- Number of holes in unavoidable sets of partial words. I.
- scientific article; zbMATH DE number 2213327 (Why is no real title available?)
- Generalized cancellation-and-permutation properties, regular languages and supports of rational series
- Termination of rewriting
- Finite language forbidding-enforcing systems
- On total regulators generated by derivation relations
- scientific article; zbMATH DE number 3911731 (Why is no real title available?)
- On the commutative equivalence of bounded context-free and regular languages: the code case
- Unavoidable sets and circular splicing 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)
