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.
- On the computation of entropy prior complexity and marginal prior distribution for the Bernoulli model (Q2320933) (← links)
- On decidability of list structures (Q2332060) (← links)
- Inflations of geometric grid classes of permutations (Q2339726) (← links)
- The exact complexity of the infinite Post Correspondence Problem (Q2345861) (← links)
- Existence of constants in regular splicing languages (Q2346417) (← links)
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (Q2347800) (← links)
- \textit{The critic as artist}: Oscar Wilde's prolegomena to shape grammars (Q2361305) (← links)
- Equivalence in automata theory based on complete residuated lattice-valued logic (Q2372274) (← links)
- One-unambiguity of regular expressions with numeric occurrence indicators (Q2373702) (← links)
- Efficient algorithms for regular expression constrained sequence alignment (Q2379980) (← links)
- The \$-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems (Q2383594) (← links)
- Algorithmic complexity as a criterion of unsolvability (Q2383595) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- Faster exact distributions of pattern statistics through sequential elimination of states (Q2397054) (← links)
- Time window temporal logic (Q2402278) (← links)
- Boolean language operations on nondeterministic automata with a pushdown of constant height (Q2403237) (← links)
- Model approach to grammatical evolution: theory and case study (Q2403418) (← links)
- Verification of finite-state machines: a distributed approach (Q2413026) (← links)
- A new certificate for copositivity (Q2418975) (← links)
- Distributional learning of conjunctive grammars and contextual binary feature grammars (Q2424694) (← links)
- Model checking of pushdown systems for projection temporal logic (Q2424879) (← links)
- Formal languages for integer programming modeling of shift scheduling problems (Q2430360) (← links)
- Secure communications with strange planet protocol (Q2439509) (← links)
- Modeling time criticality of information (Q2445406) (← links)
- The word problem for visibly pushdown languages described by grammars (Q2461562) (← links)
- Magic numbers in the state hierarchy of finite automata (Q2461796) (← links)
- A note on occurrence of gapped patterns in i.i.d. Sequences (Q2462355) (← links)
- Synchronous cooperation for explicit multi-threading (Q2464036) (← links)
- Simple permutations: Decidability and unavoidable substructures (Q2474234) (← links)
- Simulating Turing machines on Maurer machines (Q2480963) (← links)
- Regular splicing languages and subclasses (Q2484444) (← links)
- Parsing with a finite dictionary (Q2484450) (← links)
- On-line identification of language measure parameters for discrete-event supervisory control (Q2486817) (← links)
- Linear splicing and syntactic monoid (Q2489941) (← links)
- Weighted path queries on semistructured databases (Q2495649) (← links)
- Computational power of infinite quantum parallelism (Q2498972) (← links)
- BL-general fuzzy automata and accept behavior (Q2511003) (← links)
- Interactive proofs with quantum finite automata (Q2513604) (← links)
- On the power of circular splicing (Q2565850) (← links)
- A boundary result on enhanced time-varying distributed H systems with parallel computations (Q2575080) (← links)
- Coordination through de Bruijn sequences (Q2583702) (← links)
- Metabolic isotopomer labeling systems. III: Path tracing (Q2637572) (← links)
- Well-structured languages (Q2641880) (← links)
- String compression in FA-presentable structures (Q2682935) (← links)
- On a class of irregular languages (Q2685500) (← links)
- Ideal separation and general theorems for constrained synchronization and their application to small constraint automata (Q2695284) (← links)
- A Coinductive Animation of Turing Machines (Q2797865) (← links)
- On the Language of Primitive Partial Words (Q2799195) (← links)
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (Q2817388) (← links)
- Two Results on Discontinuous Input Processing (Q2829983) (← links)
