Locally testable languages (Q2554236)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Locally testable languages	scientific article

Statements

scholarly article

0 references

Locally testable languages (English)

0 references

zbMATH Open document ID

0 references

10.1016/S0022-0000(72)80020-5

0 references

Journal of Computer and System Sciences

0 references

publication date

1972

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Yechezkel Zalcstein

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

Lower Bound of the Number of Threshold Functions

0 references

Methods of the algebraic theory of machines. I: Decomposition theorem for generalized machines; properties preserved under series and parallel compositions of machines

0 references

Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines

0 references

0 references

The Theory of Definite Automata

0 references

On finite monoids having only trivial subgroups

0 references

0 references

0 references

Generalized sequential machine maps

0 references

Locally testable semigroups

0 references

Decomposition and complexity of finite semigroups

0 references

Characterizations of locally testable events

0 references

Algebraic decision procedures for local testability

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2554236

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2554236&oldid=34547944"