## Jewels of Formal Language TheoryRepetitions. Regularity: characterizations. Regularity: challenging problems. Codes and equality sets. Decidable and undecidable. Morphic representations. Language families. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

CHARACTERIZATIONS | 18 |

CHALLENGING PROBLEMS | 33 |

CODES AND EQUALITY SETS | 55 |

Copyright | |

6 other sections not shown

### Common terms and phrases

arrow labeled Assume automata automaton G bounded delay cardinality catenation Chapter Chomsky hierarchy Clearly co-word color-families Computer Consequently consists contains context-free grammars context-free languages defined definition digraph DOL language DOL system elementary morphisms empty word equality set Exercise fact families of regular final node finite automaton finite deterministic automaton finite language finite substitution formal language theory g and h grammar G grammatical families graph guage Hence holds implies inductive infinite initial node instance integer language denoted language equivalence problem language family left to right Lemma letter morphism h nodes of G nonempty word nonterminal notion obtained occurs possesses FPP Post correspondence problem prefix productions proof of Theorem recursively enumerable language regular expression regular language representable languages resp result satisfies sequence equivalence problem square-free star height strongly cube-free subset subword symbols system G terminal Theorem 6.5 tion triple h undecidable w-word words of length X-free