The following pages link to Adherences of languages (Q1157971):
Displaying 50 items.
- Sur les générateurs algébriques et linéaires (Q599515) (← links)
- Valuations of languages, with applications to fractal geometry (Q674334) (← links)
- Affine automata and related techniques for generation of complex images (Q685366) (← links)
- The poset of infinitary traces (Q689293) (← links)
- Representing real numbers in a generalized numeration system (Q716307) (← links)
- Prefix-free languages as \(\omega\)-generators (Q751290) (← links)
- Nivat's processing systems: decision problems related to protection and synchronization (Q761796) (← links)
- Determinism in parallel systems (Q786533) (← links)
- Some remarks on non-algebraic adherences (Q786543) (← links)
- Infinitary tree languages recognized by \(\omega\)-automata (Q794179) (← links)
- Formal languages and global cellular automaton behavior (Q807036) (← links)
- Safety and liveness of \(\omega\)-context-free languages (Q811129) (← links)
- Event fairness and non-interleaving concurrency (Q911318) (← links)
- A metric for traces (Q911785) (← links)
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) (Q914365) (← links)
- The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction (Q917321) (← links)
- Strategical languages of infinite words (Q989477) (← links)
- Topology on words (Q1019711) (← links)
- On infinite computations in denotational semantics (Q1051414) (← links)
- A note on \(\omega\)-regular languages (Q1053464) (← links)
- On the centers of a language (Q1054162) (← links)
- Langages infinitaires et produit de mixage (Q1061496) (← links)
- Adherences of DOL languages (Q1072713) (← links)
- Two decidability problems for infinite words (Q1072715) (← links)
- Repetition-free words (Q1078338) (← links)
- Variétés d'automates descendants d'arbres infinis (Q1079382) (← links)
- Infinite-word languages and continuous mappings (Q1082087) (← links)
- Sémantique asynchrone et comportements infinis en CPS (Q1092652) (← links)
- Finitely generated \(\omega\)-languages (Q1092671) (← links)
- Topological characterizations of infinite tree languages (Q1092675) (← links)
- On generators of rational \(\omega\)-power languages (Q1095674) (← links)
- An introduction to the regular theory of fairness (Q1102102) (← links)
- Iterated GSMs and CO-CFL (Q1112624) (← links)
- Test sets for languages of infinite words (Q1113683) (← links)
- Characterization and closure properties of linear \(\omega\)-languages (Q1127314) (← links)
- Langages sur des alphabets infinis (Q1144383) (← links)
- Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words) (Q1178712) (← links)
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems (Q1179180) (← links)
- Finitely generated bi\(\omega\)-languages (Q1183567) (← links)
- Strong fairness and ultra metrics (Q1193893) (← links)
- Rational and affine expressions for image description (Q1208468) (← links)
- \(X\)-automata on \(\omega\)-words (Q1210539) (← links)
- Finite acceptance of infinite words (Q1269902) (← links)
- On quasi orders of words and the confluence property (Q1276254) (← links)
- On codes, \(\omega\)-codes and \(\omega\)-generators (Q1349990) (← links)
- The set of minimal words of a context-free language is context-free (Q1384533) (← links)
- Restrictions and representations of vector controlled concurrent system behaviours (Q1391736) (← links)
- Ambiguity in omega context free languages (Q1399989) (← links)
- Languages, D0L-systems, sets of curves, and surface automorphisms. (Q1400580) (← links)
- Borel hierarchy and omega context free languages. (Q1401165) (← links)
