scientific article; zbMATH DE number 7268109
From MaRDI portal
Publication:5130744
DOI10.23638/DMTCS-22-1-9zbMath1451.68144arXiv1807.00663MaRDI QIDQ5130744
Edwin Hamel-de le Court, Pascal Caron, Bruno Patrou, Jean-Gabriel Luque
Publication date: 28 October 2020
Full work available at URL: https://arxiv.org/abs/1807.00663
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
A Study of a Simple Class of Modifiers: Product Modifiers ⋮ The exact state complexity for the composition of root and reversal ⋮ Unnamed Item ⋮ Operational state complexity revisited: the contribution of monsters and modifiers ⋮ Operational complexity: NFA-to-DFA trade-off ⋮ Unnamed Item ⋮ Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata ⋮ Combination of roots and Boolean operations: an application to state complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical finite transformation semigroups. An introduction.
- Intersection and union of regular languages and state complexity
- A general approach to state complexity of operations: formalization and limitations
- State complexity of some operations on binary regular languages
- State complexity of combined operations involving catenation and binary Boolean operations: beyond the Brzozowski conjectures
- State complexity of combined operations
- On the State Complexity of Star of Union and Star of Intersection
- State Complexity of Multiple Catenations
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION
- State complexity of cyclic shift
- State Complexity of Catenation Combined with a Boolean Operation: A Unified Approach
- IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
- Nondeterminism and the size of two way finite automata
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET
This page was built for publication:
