The Quantifier Alternation Hierarchy of Synchronous Relations
From MaRDI portal
Recommendations
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- Going Higher in First-Order Quantifier Alternation Hierarchies on Words
- Quantifier alternation for infinite words
- scientific article; zbMATH DE number 408810
- Quantifier alternation in two-variable first-order logic with successor is decidable
Cites work
- An introduction to finite automata and their connection to logic
- Concatenation hierarchies: new bottle, old wine
- CONCUR 2004 - Concurrency Theory
- Definable relations and first-order query languages over strings
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- 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 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 4034007 (Why is no real title available?)
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 3495598 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- On finite monoids having only trivial subgroups
- Ordering by Divisibility in Abstract Algebras
- Polynomial closure and unambiguous product
- Sets recognized by n-tape automata
Cited in
(3)
This page was built for publication: The Quantifier Alternation Hierarchy of Synchronous Relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092389)
