On the Average Number of States of Partial Derivative Automata
From MaRDI portal
Publication:3584886
DOI10.1007/978-3-642-14455-4_12zbMATH Open1250.68149OpenAlexW2140406291MaRDI QIDQ3584886FDOQ3584886
Authors: Sabine Broda, António Machiavelo, Nelma Moreira, Rogério Reis 
Publication date: 31 August 2010
Published in: Developments in Language Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14455-4_12
Recommendations
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- On the average state complexity of partial derivative transducers
- The Average Transition Complexity of Glushkov and Partial Derivative Automata
- On the average size of Glushkov and partial derivative automata
- On the average complexity of partial derivative automata for semi-extended expressions
- On the state complexity of partial derivative automata for regular expressions with intersection
- On the average complexity of partial derivative transducers
- On properties and state complexity of deterministic state-partition automata
- State complexity of partial word finite automata
- On the average state and transition complexity of finite languages
Cited In (13)
- On the average state complexity of partial derivative automata: an analytic combinatorics approach
- Partial derivative automata formalized in Coq
- On the state complexity of partial derivative automata for regular expressions with intersection
- Asymptotic estimation of the average number of terminal states in DAWGs
- On the average state complexity of partial derivative transducers
- On the number of active states in finite automata
- On the size of partial derivatives and the word membership problem
- On the average complexity of partial derivative automata for semi-extended expressions
- Average analysis of Glushkov automata under a BST-like model
- The Average Transition Complexity of Glushkov and Partial Derivative Automata
- Lower bound for the number of states of purposeful deterministic automata
- Automata for regular expressions with shuffle
- On the average size of Glushkov and partial derivative automata
Uses Software
This page was built for publication: On the Average Number of States of Partial Derivative Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584886)
