State complexity of code operators
From MaRDI portal
Publication:2909103
DOI10.1142/S0129054111008957zbMATH Open1252.68182OpenAlexW1994062790MaRDI QIDQ2909103FDOQ2909103
Authors: Elena Pribavkina, Emanuele Rodaro 
Publication date: 29 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054111008957
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
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
- Synchronizing Automata and the Černý Conjecture
- Synchronizing automata with finitely many minimal synchronizing words
- Operational state complexity of prefix-free regular languages
- On free monoids partially ordered by embedding
- State complexity of basic operations on suffix-free regular languages
- State complexity of some operations on binary regular languages
- Intersection and union of regular languages and state complexity
- On NFAs where all states are final, initial, or both
Cited In (9)
- State complexity of cyclic shift
- State Complexity of Deletion
- On the decidability of infix inclusion problem
- Operational State Complexity under Parikh Equivalence
- On the decidability of infix inclusion problem
- Ideal regular languages and strongly connected synchronizing automata
- Groups and semigroups defined by colorings of synchronizing automata.
- State complexity of prefix, suffix, bifix and infix operators on regular languages
- Title not available (Why is that?)
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)
