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.
- A note on automatic semigroups. (Q1955595) (← links)
- Finite transducers and nondeterministic state complexity of regular languages (Q1956627) (← links)
- Some studies in hemirings by the falling fuzzy \(k\)-ideals (Q1981852) (← links)
- Theory of reaction automata: a survey (Q1983008) (← links)
- ptype: probabilistic type inference (Q1987195) (← links)
- A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205) (← links)
- Spiking neural P systems with target indications (Q1998881) (← links)
- Design and implementation of bounded-length sequence variables (Q2011574) (← links)
- Semigroups arising from asynchronous automata. (Q2016100) (← links)
- Computational complexity of synchronization under regular commutative constraints (Q2019491) (← links)
- Dynamic preference logic meets iterated belief change: representation results and postulates characterization (Q2034761) (← links)
- Extending greedy feature selection algorithms to multiple solutions (Q2036770) (← links)
- Online premeans and their computation complexity (Q2041221) (← links)
- The descriptional power of queue automata of constant length (Q2041686) (← links)
- On decidability of theories of regular languages (Q2043872) (← links)
- General decidability results for asynchronous shared-memory programs: higher-order and beyond (Q2044219) (← links)
- Communicating reaction systems with direct communication (Q2055826) (← links)
- Comparison of path-complete Lyapunov functions via template-dependent lifts (Q2085147) (← links)
- Gardens of Eden in the game of life (Q2086742) (← links)
- Active matter as a path planning interpreter (Q2094115) (← links)
- Formalization of the computational theory of a Turing complete functional language model (Q2102949) (← links)
- State complexity of binary coded regular languages (Q2112182) (← links)
- Approximate NFA universality motivated by information theory (Q2112188) (← links)
- Interval type-2 fuzzy automata and interval type-2 fuzzy grammar (Q2142536) (← links)
- Spiking neural P systems with a flat maximally parallel use of rules (Q2152302) (← links)
- On typical hesitant fuzzy automata (Q2153652) (← links)
- Second-order finite automata (Q2158302) (← links)
- Operational complexity and pumping lemmas (Q2170280) (← links)
- Stochastic analysis of minimal automata growth for generalized strings (Q2176399) (← links)
- A closeness- and priority-based logical study of social network creation (Q2183577) (← links)
- On the computation of counterexamples in compositional nonblocking verification (Q2197583) (← links)
- Zombie number of the Cartesian product of graphs (Q2217508) (← links)
- Equidecomposable magmas (Q2217775) (← links)
- Introducing synchrony in fuzzy automata (Q2219075) (← links)
- Some complete \(\omega\)-powers of a one-counter language, for any Borel class of finite rank (Q2219094) (← links)
- Multi-matching nested relations (Q2220863) (← links)
- Team bisimilarity, and its associated modal logic, for BPP nets (Q2231652) (← links)
- Constrained synchronization and commutativity (Q2235741) (← links)
- Removing nondeterminism in constant height pushdown automata (Q2252532) (← links)
- Concrete digital computation: what does it take for a physical system to compute? (Q2255184) (← links)
- On expressive power of regular realizability problems (Q2262977) (← links)
- Unique decipherability in formal languages (Q2283038) (← links)
- Moments of the count of a regular expression in a heterogeneous random sequence (Q2283677) (← links)
- Subroutines in P systems and closure properties of their complexity classes (Q2285669) (← links)
- The computational capability of chemical reaction automata (Q2311219) (← links)
- A class of restricted P colonies with string environment (Q2311263) (← links)
- Arithmetic and \(k\)-maximality of the cyclic free magma (Q2317377) (← links)
- Cell-like spiking neural P systems with evolution rules (Q2318287) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
