Adherences of languages
From MaRDI portal
Publication:1157971
DOI10.1016/0022-0000(80)90010-0zbMath0471.68052OpenAlexW2037185109MaRDI QIDQ1157971
Publication date: 1980
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(80)90010-0
Related Items (79)
On omega context free languages which are Borel sets of infinite rank. ⋮ Repetition-free words ⋮ Variétés d'automates descendants d'arbres infinis ⋮ Infinite-word languages and continuous mappings ⋮ Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations ⋮ Infinite unfair shuffles and associativity ⋮ Sémantique asynchrone et comportements infinis en CPS ⋮ Finitely generated \(\omega\)-languages ⋮ Topological characterizations of infinite tree languages ⋮ On generators of rational \(\omega\)-power languages ⋮ On codes, \(\omega\)-codes and \(\omega\)-generators ⋮ An introduction to the regular theory of fairness ⋮ Rebootable and suffix-closed $\omega $-power languages ⋮ Valuations, regular expressions, and fractal geometry ⋮ Iterated GSMs and CO-CFL ⋮ Process-centric views of data-driven business artifacts ⋮ Test sets for languages of infinite words ⋮ Parallel generation of infinite images ⋮ The topological structure of adherences of regular languages ⋮ Sur les générateurs algébriques et linéaires ⋮ Characterization and closure properties of linear \(\omega\)-languages ⋮ The set of minimal words of a context-free language is context-free ⋮ Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization ⋮ Restrictions and representations of vector controlled concurrent system behaviours ⋮ On infinitary finite length codes ⋮ Unnamed Item ⋮ Infinite Iterated Function Systems ⋮ Ambiguity in omega context free languages ⋮ Languages, D0L-systems, sets of curves, and surface automorphisms. ⋮ Langages sur des alphabets infinis ⋮ Borel hierarchy and omega context free languages. ⋮ Sequential mappings of $\omega $-languages ⋮ Sur les centres de DOL-langages ⋮ Unnamed Item ⋮ Event fairness and non-interleaving concurrency ⋮ A metric for traces ⋮ Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems) ⋮ Unnamed Item ⋮ The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction ⋮ Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words) ⋮ Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems ⋮ Fractals, dimension, and formal languages ⋮ Finitely generated bi\(\omega\)-languages ⋮ Valuations of languages, with applications to fractal geometry ⋮ Strong fairness and ultra metrics ⋮ Random reals and possibly infinite computations Part I: Randomness in ∅′ ⋮ Affine automata and related techniques for generation of complex images ⋮ Languages obtained from infinite words ⋮ The poset of infinitary traces ⋮ Rational and affine expressions for image description ⋮ \(X\)-automata on \(\omega\)-words ⋮ Infinite behaviour of Petri nets ⋮ Unnamed Item ⋮ Representing real numbers in a generalized numeration system ⋮ Strategical languages of infinite words ⋮ Topological properties of omega context-free languages ⋮ Wadge hierarchy of omega context-free languages ⋮ The topologies of sofic subshifts have computable Pierce invariants ⋮ Prefix-free languages as \(\omega\)-generators ⋮ Topology on words ⋮ On Recognition of Shift Registers ⋮ Finite acceptance of infinite words ⋮ On quasi orders of words and the confluence property ⋮ Nivat's processing systems: decision problems related to protection and synchronization ⋮ Two characterizations of rational adherences ⋮ On recognition and compactification ⋮ Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages ⋮ Finite transducers and rational transductions ⋮ Determinism in parallel systems ⋮ Some remarks on non-algebraic adherences ⋮ On infinite computations in denotational semantics ⋮ A note on \(\omega\)-regular languages ⋮ On the centers of a language ⋮ Infinitary tree languages recognized by \(\omega\)-automata ⋮ Langages infinitaires et produit de mixage ⋮ Formal languages and global cellular automaton behavior ⋮ Safety and liveness of \(\omega\)-context-free languages ⋮ Adherences of DOL languages ⋮ Two decidability problems for infinite words
Cites Work
This page was built for publication: Adherences of languages
