Adherences of languages
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3653565 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3501028 (Why is no real title available?)
- scientific article; zbMATH DE number 3513288 (Why is no real title available?)
- scientific article; zbMATH DE number 3562469 (Why is no real title available?)
- scientific article; zbMATH DE number 3578343 (Why is no real title available?)
- scientific article; zbMATH DE number 3597848 (Why is no real title available?)
- scientific article; zbMATH DE number 3602692 (Why is no real title available?)
- scientific article; zbMATH DE number 3238653 (Why is no real title available?)
- On context-free languages and push-down automata
- Theory of -languages. I: Characterizations of -context- free languages
Cited in
(79)- Some remarks on non-algebraic adherences
- Variétés d'automates descendants d'arbres infinis
- Topological properties of omega context-free languages
- Borel hierarchy and omega context free languages.
- The poset of infinitary traces
- Restrictions and representations of vector controlled concurrent system behaviours
- Langages sur des alphabets infinis
- The topological structure of adherences of regular languages
- Sémantique asynchrone et comportements infinis en CPS
- Strong fairness and ultra metrics
- Rational and affine expressions for image description
- Languages, D0L-systems, sets of curves, and surface automorphisms.
- An introduction to the regular theory of fairness
- Infinite Iterated Function Systems
- Two characterizations of rational adherences
- Infinite behaviour of Petri nets
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems
- Finite acceptance of infinite words
- On omega context free languages which are Borel sets of infinite rank.
- Un modèle asynchrone pour les systèmes distribués. (An asynchronous model of distributed systems)
- Test sets for languages of infinite words
- Representing real numbers in a generalized numeration system
- Valuations, regular expressions, and fractal geometry
- Strategical languages of infinite words
- Infinite-word languages and continuous mappings
- On quasi orders of words and the confluence property
- scientific article; zbMATH DE number 3694627 (Why is no real title available?)
- Characterization and closure properties of linear \(\omega\)-languages
- Langages infinitaires et produit de mixage
- Sequential mappings of $\omega $-languages
- Iterated GSMs and CO-CFL
- Infinitary tree languages recognized by \(\omega\)-automata
- The set of minimal words of a context-free language is context-free
- Event fairness and non-interleaving concurrency
- \(X\)-automata on \(\omega\)-words
- Finite transducers and rational transductions
- A note on \(\omega\)-regular languages
- Topological characterizations of infinite tree languages
- Infinite unfair shuffles and associativity
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages
- Parallel generation of infinite images
- Topology on words
- Adherences of DOL languages
- Prefix-free languages as \(\omega\)-generators
- Sur les générateurs algébriques et linéaires
- On infinitary finite length codes
- The topologies of sofic subshifts have computable Pierce invariants
- scientific article; zbMATH DE number 3797185 (Why is no real title available?)
- Nivat's processing systems: decision problems related to protection and synchronization
- Process-centric views of data-driven business artifacts
- Finitely generated \(\omega\)-languages
- On generators of rational \(\omega\)-power languages
- Random reals and possibly infinite computations Part I: Randomness in ∅′
- Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)
- Repetition-free words
- Finitely generated bi\(\omega\)-languages
- Fractals, dimension, and formal languages
- Determinism in parallel systems
- On codes, -codes and -generators
- On infinite computations in denotational semantics
- scientific article; zbMATH DE number 3932271 (Why is no real title available?)
- scientific article; zbMATH DE number 3725688 (Why is no real title available?)
- Sur les centres de DOL-langages
- A metric for traces
- On Recognition of Shift Registers
- On recognition and compactification
- Formal languages and global cellular automaton behavior
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- On the centers of a language
- Languages obtained from infinite words
- Two decidability problems for infinite words
- Wadge hierarchy of omega context-free languages
- Safety and liveness of \(\omega\)-context-free languages
- Rebootable and suffix-closed $\omega $-power languages
- Ambiguity in omega context free languages
- The three subfamilies of rational \(\omega\)-languages closed under \(\omega\)-transduction
- Valuations of languages, with applications to fractal geometry
- Affine automata and related techniques for generation of complex images
This page was built for publication: Adherences of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1157971)
