Pages that link to "Item:Q989556"
From MaRDI portal
The following pages link to Unary finite automata vs. arithmetic progressions (Q989556):
Displaying 16 items.
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- On the expressiveness of Büchi arithmetic (Q2233416) (← links)
- Closure properties of knapsack semilinear groups (Q2236107) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- Nondeterministic complexity in subclasses of convex languages (Q2319915) (← links)
- Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
- From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity (Q2800411) (← links)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
- Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA (Q3584969) (← links)
- (Q5094125) (← links)
- Chrobak Normal Form Revisited, with Applications (Q5200060) (← links)
- Remarks on Separating Words (Q5200088) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
