Synchronizing relations on words

DOI10.1007/s00224-014-9584-2zbMath1335.68118OpenAlexW2167483151MaRDI QIDQ905682

Diego Figueira, Leonid O. Libkin

Publication date: 28 January 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-014-9584-2

zbMATH Keywords

regularityrationalityrecognizabilityword relations

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items

Unnamed Item ⋮ Resynchronizing Classes of Word Relations ⋮ Unnamed Item ⋮ Closure properties of synchronized relations ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• SPIN
• jSpin

Cites Work

• Synchronized rational relations of finite and infinite words
• Automata for XML -- a survey
• The growth ratio of synchronous rational relations is unique
• Transductions des langages de Chomsky
• Document Spanners
• Synchronizing Relations on Words
• Graph Logics with Rational Relations and the Generalized Intersection Problem
• Decision problems among the main subfamilies of rational relations
• Definable relations and first-order query languages over strings
• Algorithmic Metatheorems for Decidable LTL Model Checking over Infinite Systems
• Visibly pushdown languages
• Properties of Finite and Pushdown Transducers
• CONCUR 2004 - Concurrency Theory
• On Relations Defined by Generalized Finite Automata
• On Context-Free Languages
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synchronizing relations on words