BOUNDED PARIKH AUTOMATA (Q2841977): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Adding nesting structure to words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Model-checking CTL* over flat Presburger counter systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Well-abstracted transition systems: Application to FIFO automata. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multi-tape and infinite-state automata—a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finite-memory automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Context-Free Languages / rank | |||
Normal rank |
Revision as of 17:18, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | BOUNDED PARIKH AUTOMATA |
scientific article |
Statements
BOUNDED PARIKH AUTOMATA (English)
0 references
30 July 2013
0 references
Parikh automata
0 references
bounded languages
0 references
determinism
0 references
semilinearity
0 references
0 references