Closure properties of synchronized relations
From MaRDI portal
Recommendations
Cites work
- Algorithmic metatheorems for decidable LTL model checking over infinite systems
- Automata, languages, and programming. 41st international colloquium, ICALP 2014, Copenhagen, Denmark, July 8--11, 2014. Proceedings, Part II
- CONCUR 2004 - Concurrency Theory
- Document spanners: a formal approach to information extraction
- Graph logics with rational relations
- Graph logics with rational relations: the role of word combinatorics
- scientific article; zbMATH DE number 1670791 (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 1538041 (Why is no real title available?)
- On Context-Free Languages
- On equivalence and uniformisation problems for finite transducers
- On Relations Defined by Generalized Finite Automata
- Path logics for querying graphs: combining expressiveness and efficiency
- Resynchronizing classes of word relations
- Semigroups, Presburger formulas, and languages
- 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
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(5)- Closure and nonclosure properties of the classes of compressible and rankable sets
- Deciding Whether or Not a Synchronous Relation is Regular Prefix
- The many facets of string transducers (invited talk)
- Synchronizing the consistency relation
- Resynchronized uniformization and definability problems for rational relations
This page was built for publication: Closure properties of synchronized relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090470)
