scientific article; zbMATH DE number 3578343

zbMath0371.68025MaRDI QIDQ4147597

Maurice Nivat

Publication date: 1977

Full work available at URL: https://eudml.org/doc/92059

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (24)

On omega context free languages which are Borel sets of infinite rank. ⋮ Infinite-word languages and continuous mappings ⋮ Linear time and branching time semantics for recursion with merge ⋮ On a subclass of \(\infty\)-regular languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Ambiguity in omega context free languages ⋮ Langages sur des alphabets infinis ⋮ Borel hierarchy and omega context free languages. ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Adherences of languages ⋮ Unnamed Item ⋮ Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words) ⋮ Une note sur la propriété de préfixe ⋮ Topological properties of omega context-free languages ⋮ Wadge hierarchy of omega context-free languages ⋮ Formal computations of non deterministic recursive program schemes ⋮ Highly Undecidable Problems For Infinite Computations ⋮ Some remarks on non-algebraic adherences ⋮ On infinite computations in denotational semantics ⋮ Fundamental properties of infinite trees ⋮ Langages infinitaires et produit de mixage

Cites Work

• Unnamed Item
• Unnamed Item
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Testing and generating infinite sequences by a finite automaton
• On context-free languages and push-down automata

This page was built for publication: