The product of rational languages

DOI10.1007/3-540-56939-1_92zbMATH Open1422.68160OpenAlexW1482585498MaRDI QIDQ4630281FDOQ4630281

Imre Simon

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_92

zbMATH Keywords

finite automatoncongruence classrational languageBoolean combinationtestable language

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterizations of locally testable events
• Limitedness theorem on finite automata with distance functions
• On the topological structure of a finitely generated semigroup of matrices
• THE EQUALITY PROBLEM FOR RATIONAL SERIES WITH MULTIPLICITIES IN THE TROPICAL SEMIRING IS UNDECIDABLE
• On finite monoids having only trivial subgroups
• Classifying regular events in symbolic logic
• Weak Second‐Order Arithmetic and Finite Automata
• Decision Problems of Finite Automata Design and Related Arithmetics
• Characterizations of some classes of regular events
• First-order logic and star-free sets
• Semigroups and languages of dot-depth two
• A generalization of the Schützenberger product of finite monoids
• Finite semigroup varieties of the form V*D
• Dot-depth of star-free events
• Representation theorems on regular languages
• Semigroupe des Parties et Relations de Green
• Improved limitedness theorems on finite automata with distance functions
• On M-varieties generated by power monoids
• Recognizable sets and power sets of finite semigroups
• Categories as algebra: An essential ingredient in the theory of monoids
• Minimal noncommutative varieties and power varieties
• The Birkhoff theorem for finite algebras
• On power varieties of semigroups
• Algorithms for determining relative star height and star height
• Pseudovarieties, generalized varieties and similarly described classes
• Algebraic decision procedures for local testability
• Partially ordered finite monoids and a theorem of I. Simon
• Implicit operations on finite \({\mathcal J}\)-trivial semigroups and a conjecture of I. Simon
• Factorization forests of finite height
• On a conjecture concerning dot-depth two languages
• The dot-depth hierarchy of star-free languages is infinite
• Power monoids and finite J-trivial monoids
• An application of the Ehrenfeucht-Fraisse game in formal language theory
• A decision procedure for the order of regular events
• Inverse monoids of dot-depth two

Cited In (8)

• Title not available (Why is that?)
• Polynomial closure of group languages and open sets of the Hall topology
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial closure of group languages and open sets of the Hall topology
• Algebraic tools for the concatenation product.
• Polynomial closure and unambiguous product
• Rational languages defined with a non-associative concatenation

Recommendations

• On syntactic nuclei of rational languages 👍 👎
• Rational languages and the Burnside problem 👍 👎
• The signature of rational languages 👍 👎
• Rational languages defined with a non-associative concatenation 👍 👎
• Nonstandard approach to general rational languages 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: The product of rational languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630281)