Prefix grammars: An alternative characterization of the regular languages (Q1332773): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| 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/0020-0190(94)00074-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003192754 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Learning regular sets from queries and counterexamples / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: When won't membership queries help? / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Prediction-preserving reducibility / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 17:37, 22 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Prefix grammars: An alternative characterization of the regular languages |
scientific article |
Statements
Prefix grammars: An alternative characterization of the regular languages (English)
0 references
5 September 1994
0 references
A prefix grammar \(G\) describes a language \(L_ G\) by (1) explicitly specifying a finite subset of the strings of \(L_ G\), and (2) specifying productions that rewrite prefixes of strings in \(L_ G\), to yield other strings in \(L_ G\). Suffix grammars can be defined in the obvious manner analogous to prefix grammars. This paper shows that prefix grammars generate exactly the regular languages.
0 references
suffix grammars
0 references
prefix grammars
0 references
regular languages
0 references
