Pages that link to "Item:Q4506483"
From MaRDI portal
The following pages link to Introduction to automata theory, languages, and computation. (Q4506483):
Displaying 50 items.
- Algorithmic aspects of decomposition and equivalence of finite-valued transducers (Q259883) (← links)
- Fast learning of restricted regular expressions and dtds (Q269337) (← links)
- Solving the parity problem in one-dimensional cellular automata (Q272769) (← links)
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure (Q279371) (← links)
- Objective computation versus subjective computation (Q320171) (← links)
- Infinite games specified by 2-tape automata (Q324245) (← links)
- The state complexity of random DFAs (Q338393) (← links)
- Modeling grammatical evolution by automaton (Q351022) (← links)
- Generating, sampling and counting subclasses of regular tree languages (Q359886) (← links)
- Stability and robustness of planar switching linear systems (Q360665) (← links)
- A complete one-way function based on a finite rank free \(\mathbb{Z}\times\mathbb{Z}\)-module (Q376132) (← links)
- Processes with infinite liveness requirements (Q383788) (← links)
- Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source (Q384993) (← links)
- Tree shuffle (Q389936) (← links)
- State complexity of star of union and square of union on \textit{k} regular languages (Q391180) (← links)
- A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem (Q398914) (← links)
- Size lower bounds for quantum automata (Q403023) (← links)
- Controlled finite automata (Q404012) (← links)
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (Q414441) (← links)
- An inner product space on irreducible and synchronizable probabilistic finite state automata (Q415553) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- A graph theoretic approach to automata minimality (Q418805) (← links)
- Automata theory based on lattice-ordered semirings (Q422445) (← links)
- Doubly-constrained LCS and hybrid-constrained LCS problems revisited (Q436604) (← links)
- \(E\)-unification with constants vs. general \(E\)-unification (Q438584) (← links)
- Vector space formulation of probabilistic finite state automata (Q439977) (← links)
- State complexity of combined operations with two basic operations (Q441851) (← links)
- The size-cost of Boolean operations on constant height deterministic pushdown automata (Q443731) (← links)
- Three research directions in non-uniform cellular automata (Q475396) (← links)
- Program verification using symbolic game semantics (Q477213) (← links)
- Learning register automata: from languages to program structures (Q479461) (← links)
- On translating Lambek grammars with one division into context-free grammars (Q511445) (← links)
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- Automata for unordered trees (Q515668) (← links)
- Two double-exponential gaps for automata with a limited pushdown (Q515677) (← links)
- Quantum finite automata: advances on Bertoni's ideas (Q517033) (← links)
- Z3str2: an efficient solver for strings, regular expressions, and length constraints (Q526767) (← links)
- Constrained sequence analysis algorithms in computational biology (Q527151) (← links)
- Approximate XML structure validation based on document-grammar tree similarity (Q527155) (← links)
- Strong emergence of wave patterns on Kadanoff sandpiles (Q528976) (← links)
- Juxtaposing Catalan permutation classes with monotone ones (Q528986) (← links)
- Collaborative planning with confidentiality (Q540688) (← links)
- Hoare logic-based genetic programming (Q543275) (← links)
- An improved algorithm for determinization of weighted and fuzzy automata (Q543822) (← links)
- Some results on the structure of unary unambiguous automata (Q544137) (← links)
- Intrinsic quantum computation (Q552555) (← links)
- A characterization of (regular) circular languages generated by monotone complete splicing systems (Q606981) (← links)
- Solutions of equations in languages (Q607397) (← links)
- Preventing injection attacks with syntax embeddings (Q608228) (← links)
- Subsequential transducers: a coalgebraic perspective (Q618167) (← links)
