Publication:4003737
From MaRDI portal
zbMath0778.68065MaRDI QIDQ4003737
Publication date: 23 January 1993
Turing machines; finite automata; context-free languages; syntactic monoids; rational languages; Kleene's theorem; varieties of languages; right-linear grammars; Pushdown automata; Pumping Lemma
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68Q45: Formal languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
Related Items
ON GROUPS WHICH ARE SYNTACTIC MONOIDS OF DETERMINISTIC CONTEXT-FREE LANGUAGES, Anisimov's Theorem for inverse semigroups, Representations of commutative asynchronous automata, John Macintosh Howie: work and legacy, Cayley graphs as classifiers for data mining: the influence of asymmetries, A Munn type representation for a class of \(E\)-semiadequate semigroups, A method for the construction of complete congruences on lattices of pseudovarieties, An equivalence relation on \(\{ 0,1\}^*\), Completely simple codes, A geometric approach to (semi)-groups defined by automata via dual transducers., Groups and semigroups defined by colorings of synchronizing automata, On finite generation and presentability of Schützenberger products, Unnamed Item