Regular ideal languages and their Boolean combinations

DOI10.1007/978-3-642-31606-7_18zbMATH Open1297.68141OpenAlexW1951811146MaRDI QIDQ2914710FDOQ2914710

Authors: Franz Jahn, Manfred Kufleitner, Alexander Lauser 

Publication date: 20 September 2012

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31606-7_18

Recommendations

• Most complex regular ideal languages
• Most Complex Regular Right-Ideal Languages
• Representations of regular ideals in finite automata
• Boolean algebras of regular languages
• Regular languages of infinite trees that are Boolean combinations of open sets

zbMATH Keywords

idealtwo-way automatonone-way automatonStaiger-Wagner acceptanceweak automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Cited In (6)

• Representations of regular ideals in finite automata
• Regular binoid expressions and regular binoid languages.
• Boolean Algebras of Regular Languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• Regular languages of infinite trees that are Boolean combinations of open sets

This page was built for publication: Regular ideal languages and their Boolean combinations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914710)