Trimming visibly pushdown automata (Q2344743): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 02:52, 10 July 2024

scientific article

Language	Label	Description	Also known as
English	Trimming visibly pushdown automata	scientific article

Statements

scholarly article

0 references

Trimming visibly pushdown automata (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.tcs.2015.01.018

0 references

0 references

Pierre-Alain Reynier

0 references

Jean-Marc Talbot

0 references

Theoretical Computer Science

0 references

publication date

18 May 2015

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

visibly pushdown automata

0 references

trimming

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2015.01.018

0 references

0 references

Automata, Languages and Programming

0 references

Visibly pushdown languages

0 references

Adding nesting structure to words

0 references

0 references

0 references

On the Determinization of Weighted Finite Automata

0 references

Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness

0 references

Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles

0 references

0 references

Properties of Visibly Pushdown Transducers

0 references

0 references

0 references

On finite semigroups of matrices

0 references

Visibly Pushdown Transducers

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2344743

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