On deterministic finite automata and syntactic monoid size
From MaRDI portal
Publication:703576
DOI10.1016/J.TCS.2004.04.010zbMATH Open1161.68536OpenAlexW2022378152MaRDI QIDQ703576FDOQ703576
Publication date: 11 January 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.04.010
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?)
- A Remark on Stirling's Formula
- An introduction to chromatic polynomials
- Automata Studies. (AM-34)
- On the maximal order in $S_n$ and $S*_n$
- Implementation and Application of Automata
- New upper bounds for the greatest number of proper colorings of a (V,E)‐graph
- Sur l'ordre maximum d'un élément dans le groupe $S_n$ des permutations
- Ordre maximal d'un élément du groupe $S_n$ des permutations et «highly composite numbers»
Cited In (26)
- Complexity of proper prefix-convex regular languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- State complexity of permutation on finite languages over a binary alphabet
- Commutative nilpotent transformation semigroups
- Syntactic complexity of regular ideals
- State complexity of deletion and bipolar deletion
- Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages
- Generalized Post embedding problems
- Green's relations in finite transformation semigroups
- Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES
- Green's relations in deterministic finite automata
- On the size of inverse semigroups given by generators
- Most Complex Non-Returning Regular Languages
- Syntactic complexity of suffix-free languages
- Complexity of proper prefix-convex regular languages
- Operations on Weakly Recognizing Morphisms
- Representation of (Left) Ideal Regular Languages by Synchronizing Automata
- Syntactic complexity of bifix-free regular languages
- Descriptional complexity of regular languages
- The complexity of weakly recognizing morphisms
- Syntactic complexity of bifix-free languages
- Complexity of suffix-free regular languages
Recommendations
- 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?) 👍 👎
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)
