Algebraic Theory of Automata and Languages
From MaRDI portal
Publication:4826930
DOI10.1142/4791zbMath1069.68075OpenAlexW4243906190MaRDI QIDQ4826930
Publication date: 15 November 2004
Full work available at URL: https://doi.org/10.1142/4791
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)
Related Items
Word problems of groups: formal languages, characterizations and decidability ⋮ Interval type-2 fuzzy automata and interval type-2 fuzzy grammar ⋮ Using SAT solvers for synchronization issues in non-deterministic automata ⋮ A lower bound for the length of the shortest carefully synchronizing words ⋮ Synchronization of Automata with One Undefined or Ambiguous Transition ⋮ Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages ⋮ Languages generated by iterated idempotency ⋮ Careful synchronization of partial deterministic finite automata ⋮ Lattice structures of automata ⋮ Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata ⋮ Tree shuffle ⋮ Monoid-matrix type automata ⋮ Regularity Conditions for Iterated Shuffle on Commutative Regular Languages ⋮ Unnamed Item ⋮ On structure and representations of cyclic automata ⋮ Representations of commutative asynchronous automata ⋮ Algebraic structures of automata ⋮ Slowly synchronizing automata with zero and noncomplete sets ⋮ Duplication in DNA Sequences ⋮ Set systems: order types, continuous nondeterministic deformations, and quasi-orders ⋮ On Regularity-Preservation by String-Rewriting Systems ⋮ Shuffles of trees ⋮ Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory ⋮ Cascade connections and triangular products of linear automata ⋮ The Length of Subset Reachability in Nondeterministic Automata ⋮ On Shuffling a Word with its Letter-to-Letter Substitution ⋮ Regularity conditions for iterated shuffle on commutative regular languages ⋮ The commutative closure of shuffle languages over group languages is regular
