On deterministic finite automata and syntactic monoid size
From MaRDI portal
Publication:703576
Recommendations
- scientific article; zbMATH DE number 1948503
- scientific article; zbMATH DE number 2040919
- scientific article; zbMATH DE number 1949657
- scientific article; zbMATH DE number 1809722
- The minimal deterministic finite automaton recognizing the strong semilattice of finite monoids
- scientific article; zbMATH DE number 1979687
- On monogenic nondeterministic automata
- scientific article; zbMATH DE number 6719345
- scientific article; zbMATH DE number 3943060
- scientific article; zbMATH DE number 3894481
Cites work
- scientific article; zbMATH DE number 3148402 (Why is no real title available?)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 3657869 (Why is no real title available?)
- scientific article; zbMATH DE number 3552814 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3099421 (Why is no real title available?)
- A Remark on Stirling's Formula
- An introduction to chromatic polynomials
- Automata Studies. (AM-34)
- Implementation and Application of Automata
- New upper bounds for the greatest number of proper colorings of a (V,E)‐graph
- On the maximal order in $S_n$ and $S*_n$
- Ordre maximal d'un élément du groupe $S_n$ des permutations et «highly composite numbers»
- Sur l'ordre maximum d'un élément dans le groupe $S_n$ des permutations
Cited in
(31)- On the size of inverse semigroups given by generators
- scientific article; zbMATH DE number 3943060 (Why is no real title available?)
- scientific article; zbMATH DE number 1948503 (Why is no real title available?)
- scientific article; zbMATH DE number 2040919 (Why is no real title available?)
- The complexity of weakly recognizing morphisms
- Green's relations in deterministic finite automata
- Syntactic complexity of bifix-free languages
- Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
- Regular \(\mathcal{D}\)-length: a tool for improved prefix-stable forward Ramsey factorisations
- Complexity of proper prefix-convex regular languages
- Commutative nilpotent transformation semigroups
- Complexity of suffix-free regular languages
- scientific article; zbMATH DE number 2040924 (Why is no real title available?)
- Green's relations in finite transformation semigroups
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- Operations on weakly recognizing morphisms
- The minimal deterministic finite automaton recognizing the strong semilattice of finite monoids
- Representation of (left) ideal regular languages by synchronizing automata
- Syntactic complexity of suffix-free languages
- Syntactic complexity of bifix-free regular languages
- Syntactic complexity of regular ideals
- Most complex non-returning regular languages
- Descriptional complexity of regular languages
- State complexity of deletion and bipolar deletion
- Syntactic monoids in a category
- State complexity of permutation on finite languages over a binary alphabet
- Complexity of proper prefix-convex regular languages
- A categorical approach to syntactic monoids
- Complexity of left-ideal, suffix-closed and suffix-free regular languages
- Syntactic complexity of \(\mathcal{R}\)- and \(\mathcal{J}\)-trivial regular languages
- The genus of regular languages
This page was built for publication: On deterministic finite automata and syntactic monoid size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703576)
