scientific article; zbMATH DE number 5605092

zbMATH Open1169.68460MaRDI QIDQ3396589FDOQ3396589

Authors: Christian Choffrut 

Publication date: 19 September 2009

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Cited In (11)

• Closure properties of synchronized relations
• Theoretical and implementational aspects of the formal language server (LaSer)
• Title not available (Why is that?)
• Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
• Synchronizing relations on words
• The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata
• The Quantifier Alternation Hierarchy of Synchronous Relations
• Resynchronizing classes of word relations
• Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem
• Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
• Title not available (Why is that?)

This page was built for publication:

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