Towards a formal proof system for \(\omega\)-rational expressions

DOI10.1016/0020-0190(84)90079-6zbMath0575.68082OpenAlexW2093462809MaRDI QIDQ1064076

B. George

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90079-6

zbMATH Keywords

equality testinginfinitary rational languagesomega-rational languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25)

Related Items (1)

About fair asynchrony

Cites Work

• COSY - a system specification language based on paths and processes
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards a formal proof system for \(\omega\)-rational expressions