On total regulators generated by derivation relations

DOI10.1016/0304-3975(85)90162-8zbMath0606.68074OpenAlexW1992511274MaRDI QIDQ1084874

David Haussler, W. Bucher, Andrzej Ehrenfeucht

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90162-8

zbMATH Keywords

regular languagecontext-free languagesunavoidable setswell-quasi- order

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

Applications of an infinite square-free co-CFL ⋮ Well quasi-orders arising from finite ordered semigroups ⋮ On the generation of powers by OS schemes ⋮ On the degree of non-regularity of context-free languages ⋮ Regular languages and partial commutations ⋮ Regular solutions of language inequalities and well quasi-orders ⋮ A regularity test for dual bordered OS systems ⋮ Rational subsets and submonoids of wreath products.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orderings for term-rewriting systems
• On regularity of context-free languages
• An infinite square-free co-CFL
• Commutative one-counter languages are regular
• A note on off-line machines with 'Brownian' input heads
• On extendibility of unavoidable sets
• Effective constructions in well-partially-ordered free monoids
• The theory of well-quasi-ordering: a frequently discovered concept
• On free monoids partially ordered by embedding
• Ordering by Divisibility in Abstract Algebras

This page was built for publication: On total regulators generated by derivation relations