On total regulators generated by derivation relations

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

Andrzej Ehrenfeucht, David Haussler, W. Bucher

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 language; context-free languages; unavoidable sets; well-quasi- order

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

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

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