scientific article; zbMATH DE number 7453083
From MaRDI portal
Publication:5020533
Edwin Hamel-de le Court, Caron Pascal, Jean-Gabriel Luque
Publication date: 6 January 2022
Full work available at URL: https://arxiv.org/abs/1909.07663
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (3)
A Study of a Simple Class of Modifiers: Product Modifiers ⋮ Operational state complexity revisited: the contribution of monsters and modifiers ⋮ Combination of roots and Boolean operations: an application to state complexity
Cites Work
- State complexity of power
- 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 the Shuffle of Regular Languages
- On the State Complexity of Star of Union and Star of Intersection
- 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
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
