The following pages link to Markus Holzer (Q198230):
Displaying 50 items.
- (Q294611) (redirect page) (← links)
- On a hierarchy of languages generated by cooperating distributed grammar systems (Q294612) (← links)
- Nondeterministic state complexity of star-free languages (Q442152) (← links)
- Decidability of operation problems for T0L languages and subclasses (Q553300) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- Complexity of multi-head finite automata: origins and directions (Q616495) (← links)
- Equilibria of graphical games with symmetries (Q627165) (← links)
- On the size of inverse semigroups given by generators (Q627176) (← links)
- Inductive counting for width-restricted branching programs (Q675225) (← links)
- On deterministic finite automata and syntactic monoid size (Q703576) (← links)
- On the grammatical complexity of finite languages (Q777998) (← links)
- The range of state complexities of languages resulting from the cascade product -- the general case (extended abstract) (Q832942) (← links)
- On the uniqueness of shuffle on words and finite languages (Q837162) (← links)
- The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria (Q845734) (← links)
- Programmed grammars and their relation to the LBA problem (Q852006) (← links)
- Iterated sequential transducers as language generating devices (Q861252) (← links)
- Boundary sets of regular and context-free languages (Q896680) (← links)
- A note on cooperating distributed grammar systems working in combined modes (Q963465) (← links)
- Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
- On input-revolving deterministic and nondeterministic finite automata (Q1041031) (← links)
- Expressing uniformity via oracles (Q1361886) (← links)
- McNaughton families of languages. (Q1401181) (← links)
- The complexity of tensor calculus (Q1413648) (← links)
- Multi-head finite automata: Data-independent versus data-dependent computations (Q1608894) (← links)
- The ranges of accepting state complexities of languages resulting from some operations (Q1616974) (← links)
- Decidability of right one-way jumping finite automata (Q1622951) (← links)
- On minimal grammar problems for finite languages (Q1622981) (← links)
- Computational complexity of decision problems on self-verifying finite automata (Q1622990) (← links)
- Reversible nondeterministic finite automata (Q1705574) (← links)
- On the computational complexity of problems related to distinguishability sets (Q1706155) (← links)
- On the descriptional complexity of finite automata with modified acceptance conditions (Q1763715) (← links)
- TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable (Q1765243) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- Hybrid modes in cooperating distributed grammar systems: Combining the \(t\)-mode with the modes \(\leqslant k\) and \(=k\) (Q1874414) (← links)
- Assembling molecules in ATOMIX is hard (Q1885003) (← links)
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton (Q1959648) (← links)
- On the number of active states in finite automata (Q2041683) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- More on the descriptional complexity of products of finite automata (Q2096585) (← links)
- Comparison of free-surface and conservative Allen-Cahn phase-field lattice Boltzmann method (Q2106979) (← links)
- On the descriptional complexity of the direct product of finite automata (Q2112184) (← links)
- Nondeterministic right one-way jumping finite automata (Q2113381) (← links)
- On the computational complexity of reaction systems, revisited (Q2117085) (← links)
- The range of state complexities of languages resulting from the cascade product -- the unary case (extended abstract) (Q2117666) (← links)
- On minimizing regular expressions without Kleene star (Q2140503) (← links)
- On 25 years of CIAA through the lens of data science (Q2164730) (← links)
- Semi-linear lattices and right one-way jumping finite automata (extended abstract) (Q2177600) (← links)
- Nondeterministic right one-way jumping finite automata (extended abstract) (Q2179327) (← links)
- Non-recursive trade-offs are ``almost everywhere'' (Q2179345) (← links)
- Determination of finite automata accepting subregular languages (Q2271457) (← links)
