Pages that link to "Item:Q4826930"
From MaRDI portal
The following pages link to Algebraic Theory of Automata and Languages (Q4826930):
Displaying 32 items.
- Tree shuffle (Q389936) (← links)
- Monoid-matrix type automata (Q391753) (← links)
- A bialgebraic approach to automata and formal language theory (Q408529) (← links)
- Representations of commutative asynchronous automata (Q414910) (← links)
- Algebraic structures of automata (Q418779) (← links)
- Set systems: order types, continuous nondeterministic deformations, and quasi-orders (Q653312) (← links)
- Cascade connections and triangular products of linear automata (Q743574) (← links)
- A lower bound for the length of the shortest carefully synchronizing words (Q845082) (← links)
- Languages generated by iterated idempotency (Q868949) (← links)
- On structure and representations of cyclic automata (Q897902) (← links)
- Languages, D0L-systems, sets of curves, and surface automorphisms. (Q1400580) (← links)
- Word problems of groups: formal languages, characterizations and decidability (Q1623276) (← links)
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata (Q1678755) (← links)
- Shuffles of trees (Q1750210) (← links)
- Regularity conditions for iterated shuffle on commutative regular languages (Q2117658) (← links)
- The commutative closure of shuffle languages over group languages is regular (Q2117662) (← links)
- Interval type-2 fuzzy automata and interval type-2 fuzzy grammar (Q2142536) (← links)
- Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages (Q2163995) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Slowly synchronizing automata with zero and noncomplete sets (Q2435786) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- Synchronization of Automata with One Undefined or Ambiguous Transition (Q2914716) (← links)
- Duplication in DNA Sequences (Q3533029) (← links)
- On Regularity-Preservation by String-Rewriting Systems (Q3540126) (← links)
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory (Q3618571) (← links)
- (Q3686061) (← links)
- The Length of Subset Reachability in Nondeterministic Automata (Q4982094) (← links)
- On Shuffling a Word with its Letter-to-Letter Substitution (Q4988960) (← links)
- Lattice structures of automata (Q5083484) (← links)
- (Q5867518) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages (Q6647746) (← links)