scientific article; zbMATH DE number 2051828
From MaRDI portal
Publication:4453869
Recommendations
Cites work
- scientific article; zbMATH DE number 1670879 (Why is no real title available?)
- scientific article; zbMATH DE number 1688392 (Why is no real title available?)
- scientific article; zbMATH DE number 2086254 (Why is no real title available?)
- scientific article; zbMATH DE number 6003856 (Why is no real title available?)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 4076666 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 1324669 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1064109 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 2016845 (Why is no real title available?)
- scientific article; zbMATH DE number 1841830 (Why is no real title available?)
- scientific article; zbMATH DE number 1405667 (Why is no real title available?)
- scientific article; zbMATH DE number 3287733 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- scientific article; zbMATH DE number 3186872 (Why is no real title available?)
- A Property of Finite Simple Non-Abelian Groups
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Classification of finite monoids: the language approach
- Critical classes for the \(\alpha _ 0\)-product
- Decision Problems of Finite Automata Design and Related Arithmetics
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Lindström quantifiers and leaf language definability
- Logic, semigroups and automata on words
- Monadic Logic of Order over Naturals has no Finite Base
- On finite monoids having only trivial subgroups
- On the expressive power of temporal logic
- On uniformity within \(NC^ 1\)
- Regular languages defined with generalized quantifiers
- Regular languages in \(NC\)
- Results on homomorphic realization of automata by \(\alpha_ 0\)-products
- The descriptive complexity approach to LOGCFL
- The kernel of monoid morphisms
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(10)- Turing machines and bimachines
- Regular languages defined with generalized quantifiers
- scientific article; zbMATH DE number 4076666 (Why is no real title available?)
- Hierarchies and reducibilities on regular languages related to modulo counting
- Typed monoids -- an Eilenberg-like theorem for non regular languages
- Actions, wreath products of \(\mathcal C\)-varieties and concatenation product.
- Regular Languages Definable by Majority Quantifiers with Two Variables
- On second-order monadic monoidal and groupoidal quantifiers
- Trace languages definable with modular quantifiers
- Lindström quantifiers and leaf language definability
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4453869)