On jump-deterministic pushdown automata (Q4141220)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 3568661

Language	Label	Description	Also known as
English	On jump-deterministic pushdown automata	scientific article; zbMATH DE number 3568661

Statements

scholarly article

0 references

On jump-deterministic pushdown automata (English)

0 references

zbMATH Open document ID

0 references

10.1007/BF01768471

0 references

Mathematical Systems Theory

0 references

publication date

1977

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Bruno Courcelle

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

Tree generating regular systems

0 references

Regular canonical systems

0 references

0 references

Deterministic context free languages

0 references

Jump PDA’s and Hierarchies of Deterministic Context-Free Languages

0 references

Strict deterministic grammars

0 references

Real-Time Strict Deterministic Languages

0 references

On the Parsing of Deterministic Languages

0 references

The decidability of equivalence for deterministic stateless pushdown automata

0 references

0 references

A result on the equivalence problem for deterministic pushdown automata

0 references

Properties of deterministic top-down grammars

0 references

On context-free languages and push-down automata

0 references

A regularity test for pushdown machines

0 references

Characterization of flowchartable recursions

0 references

Regularity and Related Problems for Deterministic Pushdown Automata

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4141220

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4141220&oldid=34603670"