Deciding FO-definability of regular languages
From MaRDI portal
Cites work
- A note on the reduction of two-way automata to one-way automata
- Aperiodic two-way transducers and FO-transductions
- Boolean function complexity. Advances and frontiers.
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Complexity of some problems from the theory of automata
- Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic
- Decision Problems of Finite Automata Design and Related Arithmetics
- Explicit bounds for primes in arithmetic progressions
- Finite-automaton aperiodicity is PSPACE-complete
- First-order rewritability of ontology-mediated queries in linear temporal logic
- scientific article; zbMATH DE number 5604119 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1134629 (Why is no real title available?)
- scientific article; zbMATH DE number 3254906 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- scientific article; zbMATH DE number 3186871 (Why is no real title available?)
- Linking Data to Ontologies
- Nonsolvable finite groups all of whose local subgroups are solvable
- On finite monoids having only trivial subgroups
- Regular languages in \(NC\)
- Solvability of finite groups via conditions on products of 2-elements and odd \(p\)-elements.
- The intersection problem for finite monoids
- The membership problem in aperiodic transformation monoids
- The subgroup structure of finite classical groups in terms of geometric configurations.
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(2)
This page was built for publication: Deciding FO-definability of regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695357)
