The greatest fixed-points and rational omega-tree languages
From MaRDI portal
Publication:1082091
DOI10.1016/0304-3975(86)90123-4zbMATH Open0602.68071OpenAlexW2067751623MaRDI QIDQ1082091FDOQ1082091
Authors: Masako Takahashi 
Publication date: 1986
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(86)90123-4
Recommendations
- scientific article; zbMATH DE number 3990900
- A syntactic congruence for rational \(\omega\)-languages
- Fixed point languages of rational transductions
- A topological property of rational \(\omega\)-languages
- scientific article; zbMATH DE number 5051550
- On generators of rational \(\omega\)-power languages
- Infinitary tree languages recognized by \(\omega\)-automata
- Language-theoretical representations of \(\omega\)-languages
- Systolic tree ω-languages
- Characterizations of rational \(\omega\)-languages by means of right congruences
Cites Work
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
- Title not available (Why is that?)
- A note on \(\omega\)-regular languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Automata on infinite objects and their applications to logic and programming
- Fixed point characterization of infinite behavior of finite-state systems
- The modal mu-calculus alternation hierarchy is strict
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logical definability of fixed points
- Title not available (Why is that?)
- On modal mu-calculus and Büchi tree automata
This page was built for publication: The greatest fixed-points and rational omega-tree languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082091)
