Reversible regular languages: logical and algebraic characterisations

DOI10.3233/FI-2021-2045zbMATH Open1497.68266MaRDI QIDQ5158652FDOQ5158652

Authors:

Publication date: 25 October 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Recommendations

• Logics for reversible regular languages and semigroups with involution
• scientific article; zbMATH DE number 4020506
• On locally reversible languages
• Reversible Kleene lattices
• scientific article; zbMATH DE number 7444007

zbMATH Keywords

automatafirst-order logicmonadic second-order logicsemigroupsregular languagesreversible languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Characterizations of locally testable events
• On finite monoids having only trivial subgroups
• Classifying regular events in symbolic logic
• Title not available (Why is that?)
• Finite semigroup varieties of the form V*D
• Title not available (Why is that?)
• Languages and scanners
• Title not available (Why is that?)
• Categories as algebra: An essential ingredient in the theory of monoids
• Title not available (Why is that?)
• Logics for reversible regular languages and semigroups with involution
• Two-variable logic with a between relation
• Title not available (Why is that?)

Cited In (3)

• Logics for reversible regular languages and semigroups with involution
• Title not available (Why is that?)
• An algebraic characterisation of first-order logic with neighbour

This page was built for publication: Reversible regular languages: logical and algebraic characterisations

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