The greatest fixed-points and rational omega-tree languages

DOI10.1016/0304-3975(86)90123-4MaRDI QIDQ1082091zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

normal formRabin's special automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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 -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

• scientific article; zbMATH DE number 4096786 (Why is no real title available?)
• scientific article; zbMATH DE number 3658971 (Why is no real title available?)
• scientific article; zbMATH DE number 3709584 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3773672 (Why is no real title available?)
• scientific article; zbMATH DE number 3471986 (Why is no real title available?)
• scientific article; zbMATH DE number 3602653 (Why is no real title available?)
• scientific article; zbMATH DE number 3339435 (Why is no real title available?)
• A lattice-theoretical fixpoint theorem and its applications
• A note on \(\omega\)-regular languages
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Generalized finite automata theory with an application to a decision problem of second-order logic

Cited in

(8)

• scientific article; zbMATH DE number 5051550 (Why is no real title available?)
• On modal mu-calculus and Büchi tree automata
• Automata on infinite objects and their applications to logic and programming
• The modal mu-calculus alternation hierarchy is strict
• Logical definability of fixed points
• scientific article; zbMATH DE number 3960988 (Why is no real title available?)
• Fixed point characterization of infinite behavior of finite-state systems
• scientific article; zbMATH DE number 3919854 (Why is no real title available?)

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)