scientific article
From MaRDI portal
Publication:4003737
zbMath0778.68065MaRDI QIDQ4003737
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turing machinesfinite automatacontext-free languagessyntactic monoidsrational languagesKleene's theoremvarieties of languagesright-linear grammarsPushdown automataPumping Lemma
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (29)
Freeness of automaton groups vs boundary dynamics ⋮ Undecidability of the word problem for Yamamura's HNN-extension under nice conditions. ⋮ Quasi-injectivity of partially ordered acts ⋮ Ideal regular languages and strongly connected synchronizing automata ⋮ ON GROUPS WHICH ARE SYNTACTIC MONOIDS OF DETERMINISTIC CONTEXT-FREE LANGUAGES ⋮ Groups and semigroups defined by colorings of synchronizing automata ⋮ A method for the construction of complete congruences on lattices of pseudovarieties ⋮ Completely simple codes ⋮ On finite generation and presentability of Schützenberger products ⋮ Representations of commutative asynchronous automata ⋮ Classifying regular languages by their syntactic algebras ⋮ Down closed-quasi-injectivity of partially ordered acts ⋮ Some results in \(r\)-disjunctive languages and related topics ⋮ Restricted Burnside problem for semigroups and its application to language theory ⋮ Unnamed Item ⋮ John Macintosh Howie: work and legacy ⋮ Languages with membership determined by single letter factors ⋮ A geometric approach to (semi)-groups defined by automata via dual transducers. ⋮ Quasi injectivity andθ-internal order sum in partially ordered acts ⋮ Enumerated BSP Automata ⋮ A sufficient condition to polynomially compute a minimum separating DFA ⋮ On the homological classification of semigroups with local units ⋮ Extremal synchronizing circular automata ⋮ The applications of solid codes to r-R and r-D languages ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ Anisimov's Theorem for inverse semigroups ⋮ Unnamed Item ⋮ An equivalence relation on \(\{ 0,1\}^*\) ⋮ A Munn type representation for a class of \(E\)-semiadequate semigroups
This page was built for publication:
