INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES (Q5291302): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and forbidden words / rank
 
Normal rank
Property / cites work
 
Property / cites work: LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES / 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: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>n</i>-Prefix–suffix languages<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outfix and infix codes and related classes of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure of 3-infix-outfix maximal codes. / 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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0129054106003887 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069316473 / rank
 
Normal rank

Latest revision as of 11:10, 30 July 2024

scientific article; zbMATH DE number 5022352
Language Label Description Also known as
English
INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES
scientific article; zbMATH DE number 5022352

    Statements

    Identifiers