One-unambiguous regular languages (Q5906893): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2998389348 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3525697 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4376789 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Local languages and the Berry-Sethi algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Ambiguity in Graphs and Expressions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The validation of SGML content models / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regular expressions into finite automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deterministic regular languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Derivatives of Regular Expressions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: From regular expressions to deterministic automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: From regular expressions to DFA's using compressed NFA's / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4079524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bracketed context-free languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: THE ABSTRACT THEORY OF AUTOMATA / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4296746 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3862379 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4376790 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Pattern Matching in Strings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Amounts of nondeterminism in finite automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of restricted regular expressions and the synthesis problem for finite automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5536277 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4385527 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4848749 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4692941 / rank | |||
Normal rank |
Latest revision as of 12:00, 28 May 2024
scientific article; zbMATH DE number 1138506
Language | Label | Description | Also known as |
---|---|---|---|
English | One-unambiguous regular languages |
scientific article; zbMATH DE number 1138506 |
Statements
One-unambiguous regular languages (English)
0 references
8 September 1998
0 references
standard generalized markup language
0 references
textual markup systems
0 references
0 references