Synchronizing relations on words

DOI10.1007/S00224-014-9584-2MaRDI QIDQ905682zbMATH OpenOpenAlexFDO

Authors Diego Figueira, Leonid 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

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

Recommendations

• Synchronizing relations on words
• Resynchronizing classes of word relations
• Synchronized rational relations of finite and infinite words
• scientific article; zbMATH DE number 7376069
• Left and Right Synchronous Relations

Cites work

• scientific article; zbMATH DE number 1670791 (Why is no real title available?)
• scientific article; zbMATH DE number 438994 (Why is no real title available?)
• scientific article; zbMATH DE number 5605092 (Why is no real title available?)
• scientific article; zbMATH DE number 3660804 (Why is no real title available?)
• scientific article; zbMATH DE number 3714977 (Why is no real title available?)
• scientific article; zbMATH DE number 1222585 (Why is no real title available?)
• scientific article; zbMATH DE number 1948151 (Why is no real title available?)
• scientific article; zbMATH DE number 1538041 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• Algorithmic metatheorems for decidable LTL model checking over infinite systems
• Automata for XML -- a survey
• CONCUR 2004 - Concurrency Theory
• Decision problems among the main subfamilies of rational relations
• Definable relations and first-order query languages over strings
• Document spanners: a formal approach to information extraction
• Elements of automata theory. Translated from the French by Reuben Thomas
• Graph Logics with Rational Relations and the Generalized Intersection Problem
• On Context-Free Languages
• On Relations Defined by Generalized Finite Automata
• Principles of the SPIN model checker. Foreword by Gerard J. Holzmann
• Properties of Finite and Pushdown Transducers
• Synchronized rational relations of finite and infinite words
• Synchronizing relations on words
• The growth ratio of synchronous rational relations is unique
• Transductions des langages de Chomsky
• Visibly pushdown languages

Cited in

(9)

• Querying best paths in graph databases
• Closure properties of synchronized relations
• Synchronizing relations on words
• Resynchronizing classes of word relations
• Resynchronized uniformization and definability problems for rational relations
• scientific article; zbMATH DE number 7376069 (Why is no real title available?)
• scientific article; zbMATH DE number 7407799 (Why is no real title available?)
• Similarity relations on words
• The many facets of string transducers (invited talk)

Describes a project that uses

Uses Software

• SPIN
• jSpin

This page was built for publication: Synchronizing relations on words

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