Locally testable semigroups

DOI10.1007/BF02572893zbMath0273.20049MaRDI QIDQ2264860

Yechezkel Zalcstein

Publication date: 1973

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133940

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General structure theory for semigroups (20M10) Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (25)

Strongly locally testable semigroups with commuting idempotents and related languages ⋮ The word problem for the bifree combinatorial strict regular semigroup ⋮ Over testable languages ⋮ Representation of normal bands as semigroups of \(k\)-bi-ideals of a semiring ⋮ The varieties of n-testable semigroups ⋮ Pseudovarieties defining classes of sofic subshifts closed under taking shift equivalent subshifts. ⋮ The Structure of Pseudo-Inverse Semigroups ⋮ Unnamed Item ⋮ On minimal bi-ideal elements of an \(le\)-semigroup ⋮ On the Semigroup of Bi-Ideals of an Ordered Semigroup ⋮ Local semilattices on two generators ⋮ On bases of identities for the \(\omega\)-variety generated by locally testable semigroups. ⋮ Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order ⋮ TAMENESS OF JOINS INVOLVING THE PSEUDOVARIETY OF LOCAL SEMILATTICES ⋮ The Karoubi envelope of the mirage of a subshift ⋮ The Burnside problem for semigroups ⋮ Free profinite locally idempotent and locally commutative semigroups ⋮ La finitude des représentations linéaires des semi-groupes est decidable ⋮ Un algorithme calculant le cardinal, fini ou infini, des demi-groupes de matrices ⋮ Identities of locally testable semigroups ⋮ The natural partial order on a regular semigroup ⋮ Regular locally testable semigroups as semigroups of quasi-ideals ⋮ Locally testable languages ⋮ Optimal estimation on the order of local testability of finite automata ⋮ Algebraic decision procedures for local testability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition theorems for finite sequential machines
• Demi-groupes réguliers
• Locally testable languages
• Unending chess, symbolic dynamics and a problem in semi-groups
• Algebraic decision procedures for local testability
• Studies in the Representation Theory of Finite Semigroups
• Finiteness Conditions for Matrix Semigroups

This page was built for publication: Locally testable semigroups