Pages that link to "Item:Q1099644"
From MaRDI portal
The following pages link to Finite automata and unary languages (Q1099644):
Displaying 50 items.
- Series parallel digraphs with loops (Q372966) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- Geometrical regular languages and linear Diophantine equations: the strongly connected case (Q443737) (← links)
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- Descriptional complexity of two-way pushdown automata with restricted head reversals (Q443747) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Optimal simulation of self-verifying automata by deterministic automata (Q553320) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- On binary circle plus operator \(\oplus\)-NFAs and succinct descriptions of regular languages (Q703507) (← links)
- Optimal state reductions of automata with partially specified behaviors (Q728283) (← links)
- Iterated uniform finite-state transducers on unary languages (Q831808) (← links)
- The state complexity of \(L^{2}\) and \(L^k\) (Q844206) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- State fusion of fuzzy automata with application on target tracking (Q971574) (← links)
- Detecting palindromes, patterns and borders in regular languages (Q1041028) (← links)
- Deterministic generalized automata (Q1285583) (← links)
- Automaticity. II: Descriptional complexity in the unary case (Q1390867) (← links)
- Converting two-way nondeterministic unary automata into simpler automata. (Q1401239) (← links)
- A new algorithm for regularizing one-letter context-free grammars. (Q1426442) (← links)
- Tight lower bounds on the size of sweeping automata (Q1604196) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- On the descriptional power of heads, counters, and pebbles (Q1763719) (← links)
- Complementing unary nondeterministic automata (Q1763723) (← links)
- Simulating finite automata with context-free grammars. (Q1853167) (← links)
- Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds. (Q1872711) (← links)
- New size hierarchies for two way automata (Q1992112) (← links)
- The descriptional power of queue automata of constant length (Q2041686) (← links)
- Reversibility for stateless ordered RRWW-automata (Q2041689) (← links)
- Static and dynamic property-preserving updates (Q2042718) (← links)
- Determinisability of unary weighted automata over the rational numbers (Q2055977) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- String theories involving regular membership predicates: from practice to theory and back (Q2140459) (← links)
- On the expressiveness of Büchi arithmetic (Q2233416) (← links)
- Nondeterministic syntactic complexity (Q2233426) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- Oblivious two-way finite automata: decidability and complexity (Q2252534) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Determination of finite automata accepting subregular languages (Q2271457) (← links)
- Determinizing monitors for HML with recursion (Q2291832) (← links)
- Deterministic regular expressions with back-references (Q2316926) (← links)
- Contextual array grammars with matrix control, regular control languages, and tissue P systems control (Q2358676) (← links)
- On the complexity of determinizing monitors (Q2399244) (← links)
- Insertion operations on deterministic reversal-bounded counter machines (Q2424688) (← links)
- Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361) (← links)
- Ambiguity and structural ambiguity of symmetric difference NFAs (Q2453538) (← links)
- Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
- The monadic quantifier alternation hierarchy over grids and graphs (Q2506497) (← links)
