Rational relations having a rational trace on each finite intersection of rational relations

DOI10.1016/J.TCS.2012.03.011zbMath1247.68134OpenAlexW2031362591MaRDI QIDQ714813

Serge Grigorieff, Christian Choffrut

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.011

zbMATH Keywords

automatarational relation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rational sets in commutative monoids
• Sets recognized by n-tape automata
• Regular prefix relations
• Monadic second order definable relations on the binary tree
• On Relations Defined by Generalized Finite Automata
• Bounded Algol-Like Languages

This page was built for publication: Rational relations having a rational trace on each finite intersection of rational relations