Deciding Whether or Not a Synchronous Relation is Regular Prefix

DOI10.3233/FI-2014-1053MaRDI QIDQ2934880zbMATH OpenFDO

Authors Christian Choffrut

Publication date 22 December 2014

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2014-1053

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Regular prefix relations
• Synchronizing the consistency relation
• The Quantifier Alternation Hierarchy of Synchronous Relations
• Characterizing classes of regular languages using prefix codes of bounded synchronization delay
• Characterizing classes of regular languages using prefix codes of bounded synchronization delay
• On synchronizing prefix codes
• The relation between preset distinguishing sequences and synchronizing sequences
• Closure properties of synchronized relations
• On the undecidability and descriptional complexity of synchronized regular expressions
• scientific article; zbMATH DE number 7730616

Cited in

(3)

• Resynchronized uniformization and definability problems for rational relations
• Left and Right Synchronous Relations
• Regular prefix relations

This page was built for publication: Deciding Whether or Not a Synchronous Relation is Regular Prefix

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