Pages that link to "Item:Q4506483"
From MaRDI portal
The following pages link to Introduction to automata theory, languages, and computation. (Q4506483):
Displaying 34 items.
- Prefix monoids of groups and right units of special inverse monoids (Q6065478) (← links)
- A survey on compositional algorithms for verification and synthesis in supervisory control (Q6080680) (← links)
- On closure properties of \(\mathcal{L}\)-valued linear languages (Q6081537) (← links)
- Approximate NFA universality and related problems motivated by information theory (Q6093572) (← links)
- Pumping lemmas for classes of languages generated by folding systems (Q6095498) (← links)
- On the impact of player capability on congestion games (Q6109527) (← links)
- Generalizations of Code Languages with Marginal Errors (Q6114833) (← links)
- Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata (Q6114871) (← links)
- State complexity of binary coded regular languages (Q6120344) (← links)
- On the computational power of swarm automata using agents with position information (Q6136455) (← links)
- Symbolic encoding of LL(1) parsing and its applications (Q6151762) (← links)
- An interval temporal logic characterization of extended \(\omega\)-regular languages (Q6159024) (← links)
- On Usefulness of Information: Framework and NFA Case (Q6163619) (← links)
- Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages (Q6169895) (← links)
- On the hierarchy of swarm-automaton for the number of agents (Q6174651) (← links)
- Spiking neural P systems with weights and delays on synapses (Q6175147) (← links)
- A provably stable neural network Turing machine with finite precision and time (Q6193467) (← links)
- Divide-and-Conquer Determinization of Büchi Automata Based on SCC Decomposition (Q6487334) (← links)
- Automatically finding the right probabilities in Bayesian networks (Q6488813) (← links)
- A study of algebraic structures and logics based on categories of rough sets (Q6535069) (← links)
- Active learning of deterministic timed automata with Myhill-Nerode style characterization (Q6535622) (← links)
- On von Neumann regularity of cellular automata (Q6535755) (← links)
- Programmable single-stranded architectures for computing (Q6535757) (← links)
- On typical hesitant fuzzy languages and automata (Q6535992) (← links)
- Incremental NFA minimization (Q6558632) (← links)
- Spiking neural P systems with mute rules (Q6559032) (← links)
- Anti-context-free languages (Q6621945) (← links)
- On the satisfiability of context-free string constraints with subword-ordering (Q6649435) (← links)
- Expressiveness of extended bounded response \textsf{LTL} (Q6649521) (← links)
- Arbitrary sensitive transitions in recurrent neural networks (Q6650072) (← links)
- A stochastic graphs semantics for conditionals (Q6651292) (← links)
- Boolean TQFTs with accumulating defects, sofic systems, and automata for infinite words (Q6655084) (← links)
- On groups whose cogrowth series is the diagonal of a rational series (Q6660946) (← links)
- On bidirectional deterministic finite automata (Q6666791) (← links)