scientific article; zbMATH DE number 2051828

zbMath1046.20042MaRDI QIDQ4453869

Zoltán Ésik, Kim Guldstrand Larsen

Publication date: 7 March 2004

Full work available at URL: http://www.numdam.org/item?id=ITA_2003__37_3_179_0

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

semidirect productsregular languageslogicexpressive powersLindström quantifiers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Specification and verification (program logics, model checking, etc.) (68Q60) Semigroups in automata theory, linguistics, etc. (20M35) Basic properties of first-order languages and structures (03C07)

Related Items (4)

Turing machines and bimachines ⋮ 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.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of recognizable sets corresponding to certain varieties of finite monoids
• Critical classes for the \(\alpha _ 0\)-product
• The kernel of monoid morphisms
• Classification of finite monoids: the language approach
• Results on homomorphic realization of automata by \(\alpha_ 0\)-products
• Regular languages in \(NC\)
• Logic, semigroups and automata on words
• Regular languages defined with generalized quantifiers
• On the expressive power of temporal logic
• On uniformity within \(NC^ 1\)
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• UNDECIDABILITY, AUTOMATA, AND PSEUDOVARITIES OF FINITE SEMIGROUPS
• Monadic Logic of Order over Naturals has no Finite Base
• LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY
• On finite monoids having only trivial subgroups
• A Property of Finite Simple Non-Abelian Groups
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• The descriptive complexity approach to LOGCFL

This page was built for publication: