scientific article; zbMATH DE number 2051828
From MaRDI portal
Publication:4453869
zbMATH Open1046.20042MaRDI QIDQ4453869FDOQ4453869
Publication date: 7 March 2004
Full work available at URL: http://www.numdam.org/item?id=ITA_2003__37_3_179_0
Title of this publication is not available (Why is that?)
Recommendations
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Algebraic theory of languages and automata (68Q70) Basic properties of first-order languages and structures (03C07) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- On uniformity within \(NC^ 1\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- The descriptive complexity approach to LOGCFL
- Weak Second‐Order Arithmetic and Finite Automata
- Decision Problems of Finite Automata Design and Related Arithmetics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Families of recognizable sets corresponding to certain varieties of finite monoids
- Classification of finite monoids: the language approach
- Regular languages in \(NC\)
- Logic, semigroups and automata on words
- On the expressive power of temporal logic
- Title not available (Why is that?)
- LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY
- Title not available (Why is that?)
- Regular languages defined with generalized quantifiers
- A Property of Finite Simple Non-Abelian Groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The kernel of monoid morphisms
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Title not available (Why is that?)
- UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
- Title not available (Why is that?)
- Critical classes for the \(\alpha _ 0\)-product
- Monadic Logic of Order over Naturals has no Finite Base
- Results on homomorphic realization of automata by \(\alpha_ 0\)-products
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Hierarchies and reducibilities on regular languages related to modulo counting
- Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages
- Regular languages defined with generalized quantifiers
- Actions, wreath products of \(\mathcal C\)-varieties and concatenation product.
- Turing machines and bimachines
- Title not available (Why is that?)
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)