Algebraic Theory of Automata and Languages

DOI10.1142/4791MaRDI QIDQ4826930zbMATH OpenOpenAlexFDO

Authors Masami Ito

Publication date 15 November 2004

Full work available at URL https://doi.org/10.1142/4791

zbMATH Keywords

shuffledeletioninsertionfinite automataautomorphism groupsstrongly connectedregular sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 3390671
• scientific article; zbMATH DE number 3250570
• Automata and algebraicity
• Algebraic structures of automata
• Automata algebras
• scientific article; zbMATH DE number 45581
• scientific article; zbMATH DE number 1330031
• Automata on algebraic structures
• scientific article; zbMATH DE number 3238653
• Automata in algebra

Cited in

(34)

• Monoid-matrix type automata
• Algebraic structures of automata
• Representations of commutative asynchronous automata
• Languages, D0L-systems, sets of curves, and surface automorphisms.
• A bialgebraic approach to automata and formal language theory
• scientific article; zbMATH DE number 4009825 (Why is no real title available?)
• Regularity conditions for iterated shuffle on commutative regular languages
• scientific article; zbMATH DE number 45581 (Why is no real title available?)
• A lower bound for the length of the shortest carefully synchronizing words
• Automata-theoretical regularity characterizations for the iterated shuffle on commutative regular languages
• Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
• Shuffles of trees
• On Regularity-Preservation by String-Rewriting Systems
• Languages generated by iterated idempotency
• Interval type-2 fuzzy automata and interval type-2 fuzzy grammar
• Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
• Duplication in DNA Sequences
• Cascade connections and triangular products of linear automata
• scientific article; zbMATH DE number 7584598 (Why is no real title available?)
• On structure and representations of cyclic automata
• Careful synchronization of partial deterministic finite automata
• Slowly synchronizing automata with zero and noncomplete sets
• scientific article; zbMATH DE number 3909765 (Why is no real title available?)
• Synchronization of automata with one undefined or ambiguous transition
• Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
• State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
• Lattice structures of automata
• On shuffling a word with its letter-to-letter substitution
• Using SAT solvers for synchronization issues in non-deterministic automata
• Set systems: order types, continuous nondeterministic deformations, and quasi-orders
• Word problems of groups: formal languages, characterizations and decidability
• The length of subset reachability in nondeterministic automata
• The commutative closure of shuffle languages over group languages is regular
• Tree shuffle

This page was built for publication: Algebraic Theory of Automata and Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4826930)