The following pages link to Automates a file (Q1139945):
Displaying 11 items.
- Fast nondeterministic recognition of context-free languages using two queues (Q293326) (← links)
- Compilation of the ELECTRE reactive language into finite transition systems (Q673127) (← links)
- An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets (Q1059399) (← links)
- On the intersection of stacks and queues (Q1123639) (← links)
- QRT FIFO automata, breadth-first grammars and their relations (Q1183576) (← links)
- Verifying identical communicating processes is undecidable (Q1269916) (← links)
- Fifo nets without order deadlock (Q1819941) (← links)
- Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
- Deque automata, languages, and planar graph representations (Q2192371) (← links)
- PROGRAMMED GRAMMARS WITH RULE QUEUES (Q3401467) (← links)
- Non axiomatisability of positive relation algebras with constants, via graph homomorphisms (Q5089316) (← links)
