Obtaining shorter regular expressions from finite-state automata (Q868946): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Derick Wood / rank
Normal rank
 
Property / author
 
Property / author: Derick Wood / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LANGAGE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2142662777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The validation of SGML content models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean Matrices and the Stability of Neural Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of Glushkov automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Application of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic generalized automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Thompson digraphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE ABSTRACT THEORY OF AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory Is Forever / rank
 
Normal rank
Property / cites work
 
Property / cites work: Follow automata. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal NFA Problems are Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4671950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Techniques: Regular expression search algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692941 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:15, 25 June 2024

scientific article
Language Label Description Also known as
English
Obtaining shorter regular expressions from finite-state automata
scientific article

    Statements

    Obtaining shorter regular expressions from finite-state automata (English)
    0 references
    0 references
    0 references
    26 February 2007
    0 references
    0 references
    regular languages
    0 references
    finite-state automata
    0 references
    state elimination
    0 references
    bridge states
    0 references
    vertical chopping
    0 references
    horizontal chopping
    0 references
    0 references