State complexity of code operators
From MaRDI portal
Publication:2909103
Recommendations
- State complexity of prefix, suffix, bifix and infix operators on regular languages
- Operational state complexity of prefix-free regular languages
- State Complexity of Basic Operations on Suffix-Free Regular Languages
- State complexity of basic operations on suffix-free regular languages
- State complexity of some operations on binary regular languages
Cites work
- Intersection and union of regular languages and state complexity
- On NFAs where all states are final, initial, or both
- On free monoids partially ordered by embedding
- Operational state complexity of prefix-free regular languages
- State complexity of basic operations on suffix-free regular languages
- State complexity of some operations on binary regular languages
- Synchronizing Automata and the Černý Conjecture
- Synchronizing automata with finitely many minimal synchronizing words
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
Cited in
(9)- State complexity of cyclic shift
- State Complexity of Deletion
- On the decidability of infix inclusion problem
- State complexity of prefix, suffix, bifix and infix operators on regular languages
- Groups and semigroups defined by colorings of synchronizing automata.
- On the decidability of infix inclusion problem
- scientific article; zbMATH DE number 7301304 (Why is no real title available?)
- Ideal regular languages and strongly connected synchronizing automata
- Operational State Complexity under Parikh Equivalence
This page was built for publication: State complexity of code operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909103)
