Incomplete operational transition complexity of regular languages
From MaRDI portal
Publication:498392
DOI10.1016/j.ic.2015.08.004zbMath1329.68165OpenAlexW1161730093MaRDI QIDQ498392
Nelma Moreira, Rogério Reis, Eva Maia
Publication date: 28 September 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.08.004
Related Items (5)
Further Remarks on the Operational Nonterminal Complexity ⋮ Operational Accepting State Complexity: The Unary and Finite Case ⋮ Operational complexity and right linear grammars ⋮ Unrestricted State Complexity of Binary Operations on Regular Languages ⋮ Operational union-complexity
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The state complexities of some basic operations on regular languages
- State complexity of some operations on binary regular languages
- Determination of finite automata accepting subregular languages
- Enumeration and generation with a string automata representation
- Transition complexity of language operations
- Incomplete Transition Complexity of Some Basic Operations
- Transition Complexity of Incomplete DFAs
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
- Complexity in Convex Languages
- Regular-expression derivatives re-examined
- Descriptional and Computational Complexity of Finite Automata
- State Complexity Research and Approximation
- Incomplete Transition Complexity of Basic Operations on Finite Languages
- Descriptional Complexity of Nondeterministic Finite Automata
- On the State Complexity of Combined Operations
This page was built for publication: Incomplete operational transition complexity of regular languages
